- 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 ; 26
- Klassifikation
-
Informatik
- Schlagwort
-
Lambda-Kalkül
ML
Operationale Semantik
Nebenläufigkeit
- Ereignis
-
Veröffentlichung
- (wo)
-
Frankfurt am Main
- (wer)
-
Univ.-Bibliothek Frankfurt am Main
- (wann)
-
2006
- Beteiligte Personen und Organisationen
- URN
-
urn:nbn:de:hebis:30-32230
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:45 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
- Niehren, Joachim
- Sabel, David
- Schmidt-Schauß, Manfred
- Schwinghammer, Jan
- Univ.-Bibliothek Frankfurt am Main
Entstanden
- 2006
Ähnliche Objekte (12)
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
Program equivalences for concurrency abstractions in a concurrent lambda calculus with buffers, cells and futures
Constrained lambda calculus
Dynamic Lambda Calculus
The overtyped lambda calculus
Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence
Improvements for Concurrent Haskell with Futures
Binary lambda calculus and combinatory logic
Category theory and the simply typed λ-calculus [lambda-calculus]
Some equivalence notions for concurrent systems : on overview
Abstract computing machines : a Lambda calculus perspective
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
Program equivalences for concurrency abstractions in a concurrent lambda calculus with buffers, cells and futures
Constrained lambda calculus
Dynamic Lambda Calculus
The overtyped lambda calculus
Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence
Improvements for Concurrent Haskell with Futures
Binary lambda calculus and combinatory logic
Category theory and the simply typed λ-calculus [lambda-calculus]
Some equivalence notions for concurrent systems : on overview
Abstract computing machines : a Lambda calculus perspective
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
Program equivalences for concurrency abstractions in a concurrent lambda calculus with buffers, cells and futures
Constrained lambda calculus
Dynamic Lambda Calculus
The overtyped lambda calculus
Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence
Improvements for Concurrent Haskell with Futures
Binary lambda calculus and combinatory logic
Category theory and the simply typed λ-calculus [lambda-calculus]
Some equivalence notions for concurrent systems : on overview