- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik ; 40
- Klassifikation
-
Informatik
- Schlagwort
-
Formale Semantik
Lambda-Kalkül
- Ereignis
-
Veröffentlichung
- (wo)
-
Frankfurt am Main
- (wer)
-
Univ.-Bibliothek Frankfurt am Main
- (wann)
-
2010
- Urheber
-
Schmidt-Schauß, Manfred
Sabel, David
Machkasova, Elena
- URN
-
urn:nbn:de:hebis:30-77888
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:53 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.
Beteiligte
- Schmidt-Schauß, Manfred
- Sabel, David
- Machkasova, Elena
- Univ.-Bibliothek Frankfurt am Main
Entstanden
- 2010
Ähnliche Objekte (12)
Simulation in the call-by-need lambda-calculus with letrec
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, case, constructors, and seq
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
Applicative may- and should-simulation in the call-by-value lambda calculus with amb
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
Simulation in the call-by-need lambda-calculus with letrec
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, case, constructors, and seq
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
Applicative may- and should-simulation in the call-by-value lambda calculus with amb
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
Simulation in the call-by-need lambda-calculus with letrec
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, case, constructors, and seq
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
Applicative may- and should-simulation in the call-by-value lambda calculus with amb
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec