Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Logical Methods in Computer Science, 11.2015, issue 1, paper 7, S. 1–50, DOI: 10.2168/LMCS-11(1:7)2015
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Frankfurt am Main
- (wer)
-
Universitätsbibliothek Johann Christian Senckenberg
- (wann)
-
2015
- Urheber
- URN
-
urn:nbn:de:hebis:30:3-403417
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:55 MESZ
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.
Beteiligte
- Schmidt-Schauß, Manfred
- Sabel, David
- Machkasova, Elena
- Universitätsbibliothek Johann Christian Senckenberg
Entstanden
- 2015
Ähnliche Objekte (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