Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Logical Methods in Computer Science, 11.2015, issue 1, paper 7, S. 1–50, DOI: 10.2168/LMCS-11(1:7)2015
- Classification
-
Informatik
- Event
-
Veröffentlichung
- (where)
-
Frankfurt am Main
- (who)
-
Universitätsbibliothek Johann Christian Senckenberg
- (when)
-
2015
- Creator
- URN
-
urn:nbn:de:hebis:30:3-403417
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:50 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
- Sabel, David
- Machkasova, Elena
- Universitätsbibliothek Johann Christian Senckenberg
Time of origin
- 2015
Other Objects (12)
A non-deterministic call-by-need lambda calculus
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
Simulation in the call-by-need lambda-calculus with letrec
Simulation in the call-by-need lambda-calculus with letrec
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
Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence
A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
A non-deterministic call-by-need lambda calculus
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
Simulation in the call-by-need lambda-calculus with letrec
Simulation in the call-by-need lambda-calculus with letrec
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
Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence
A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
A non-deterministic call-by-need lambda calculus
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
Simulation in the call-by-need lambda-calculus with letrec
Simulation in the call-by-need lambda-calculus with letrec
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
Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence
A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations