Monografie
Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence
- Ausgabe
-
1. Aufl.
- Sprache
-
Englisch
- Umfang
-
XXX, 358 S.
- Anmerkungen
-
Zugl.: Frankfurt (Main), Univ., Diss., 2008
- ISBN
-
978-3-89963-866-0
- Identifier
-
992163102
- Reihe
-
Informatik
Thema
Programmtransformation ; Korrektheit ; Programmiersprache ; Nebenläufigkeit ; Abstrakter Automat ; Lambda-Kalkül ; Hochschulschrift
Beteiligte Personen und Organisationen
- Inhaltsverzeichnis
- Rechteinformation
-
Der Zugriff auf Teile des Objekts ist unbeschränkt möglich.
- Letzte Aktualisierung
-
16.08.2023, 18:28 MESZ
Objekttyp
- Monografie
Beteiligte
Ähnliche Objekte (12)
Program equivalence for a concurrent lambda calculus with futures
An abstract machine for concurrent Haskell with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
Abstract computing machines : a Lambda calculus perspective
Program equivalences for concurrency abstractions in a concurrent lambda calculus with buffers, cells and futures
Region based program specialization : an operational approach to polymorphic offline partial evaluation for ML-like languages
Ein nichtdeterministischer call-by-need Lambda-Kalkül mit erratic choice : operationale Semantik, Programmtransformationen und Anwendungen
Pattern calculus : computing with functions and structures
On conservativity of concurrent Haskell
On conservativity of concurrent Haskell
Adequacy of compositional translations for observational semantics
Program equivalence for a concurrent lambda calculus with futures
An abstract machine for concurrent Haskell with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
Abstract computing machines : a Lambda calculus perspective
Program equivalences for concurrency abstractions in a concurrent lambda calculus with buffers, cells and futures
Region based program specialization : an operational approach to polymorphic offline partial evaluation for ML-like languages
Ein nichtdeterministischer call-by-need Lambda-Kalkül mit erratic choice : operationale Semantik, Programmtransformationen und Anwendungen
Pattern calculus : computing with functions and structures
On conservativity of concurrent Haskell
On conservativity of concurrent Haskell
Adequacy of compositional translations for observational semantics
Program equivalence for a concurrent lambda calculus with futures
An abstract machine for concurrent Haskell with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
Abstract computing machines : a Lambda calculus perspective
Program equivalences for concurrency abstractions in a concurrent lambda calculus with buffers, cells and futures
Region based program specialization : an operational approach to polymorphic offline partial evaluation for ML-like languages
Ein nichtdeterministischer call-by-need Lambda-Kalkül mit erratic choice : operationale Semantik, Programmtransformationen und Anwendungen
Pattern calculus : computing with functions and structures
On conservativity of concurrent Haskell
On conservativity of concurrent Haskell