On equivalences and standardization in a non-deterministic call-by-need lambda calculus
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Edition
-
Version 18. Sept. 2008
- Language
-
Englisch
- Bibliographic citation
-
Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik ; 31
- Classification
-
Informatik
- Event
-
Veröffentlichung
- (where)
-
Frankfurt am Main
- (who)
-
Univ.-Bibliothek Frankfurt am Main
- (when)
-
2009
- Creator
- URN
-
urn:nbn:de:hebis:30:3-344517
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:47 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Schmidt-Schauß, Manfred
- Mann, Matthias
- Univ.-Bibliothek Frankfurt am Main
Time of origin
- 2009
Other Objects (12)
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
A non-deterministic call-by-need lambda calculus
A non-deterministic call-by-need lambda calculus : proving similarity a precongruence by an extension of Howe's method to sharing
Simulation in the call-by-need lambda-calculus with letrec
Simulation in the call-by-need lambda-calculus with letrec
Computing overlappings by unification in the deterministic lambda calculus LR with letrec, case, constructors, seq and variable chains
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
Dynamic Lambda Calculus
Constrained lambda calculus
How to prove similarity a precongruence in non-deterministic call-by-need lambda calculi
The overtyped 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
A non-deterministic call-by-need lambda calculus
A non-deterministic call-by-need lambda calculus : proving similarity a precongruence by an extension of Howe's method to sharing
Simulation in the call-by-need lambda-calculus with letrec
Simulation in the call-by-need lambda-calculus with letrec
Computing overlappings by unification in the deterministic lambda calculus LR with letrec, case, constructors, seq and variable chains
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
Dynamic Lambda Calculus
Constrained lambda calculus
How to prove similarity a precongruence in non-deterministic call-by-need lambda calculi
The overtyped 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
A non-deterministic call-by-need lambda calculus
A non-deterministic call-by-need lambda calculus : proving similarity a precongruence by an extension of Howe's method to sharing
Simulation in the call-by-need lambda-calculus with letrec
Simulation in the call-by-need lambda-calculus with letrec
Computing overlappings by unification in the deterministic lambda calculus LR with letrec, case, constructors, seq and variable chains
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
Dynamic Lambda Calculus
Constrained lambda calculus
How to prove similarity a precongruence in non-deterministic call-by-need lambda calculi