Hochschulschrift
A non-deterministic call-by-need lambda calculus : proving similarity a precongruence by an extension of Howe's method to sharing
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Frankfurt (Main), Univ., Diss., 2005
- Schlagwort
-
Lambda-Kalkül ; Nichtdeterminismus
- Urheber
- URN
-
urn:nbn:de:hebis:30-24661
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:46 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
Ähnliche Objekte (12)
How to prove similarity a precongruence in non-deterministic call-by-need lambda calculi
A non-deterministic call-by-need lambda calculus
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
Extending automatic theorem proving by planning
Proving a Heine-Borel Theorem by Analogy
Proving non-reachability by modulo-place invariants
Theorem Proving by Analogy - A Compelling Example ?
Equivalence of call-by-name and call-by-need for lambda-calculi with letrec
Equivalence of call-by-name and call-by-need for lambda-calculi with letrec
How to prove similarity a precongruence in non-deterministic call-by-need lambda calculi
A non-deterministic call-by-need lambda calculus
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
Extending automatic theorem proving by planning
Proving a Heine-Borel Theorem by Analogy
Proving non-reachability by modulo-place invariants
Theorem Proving by Analogy - A Compelling Example ?
Equivalence of call-by-name and call-by-need for lambda-calculi with letrec
Equivalence of call-by-name and call-by-need for lambda-calculi with letrec
How to prove similarity a precongruence in non-deterministic call-by-need lambda calculi
A non-deterministic call-by-need lambda calculus
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
Extending automatic theorem proving by planning
Proving a Heine-Borel Theorem by Analogy
Proving non-reachability by modulo-place invariants
Theorem Proving by Analogy - A Compelling Example ?
Equivalence of call-by-name and call-by-need for lambda-calculi with letrec