Program equivalences for concurrency abstractions in a concurrent lambda calculus with buffers, cells and futures
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Frankfurt am Main, Johann Wolfgang Goethe-Universität, Bachelorarbeit, 2009
- Schlagwort
-
Nebenläufigkeit
Lambda-Kalkül
Haskell 98
- Ereignis
-
Veröffentlichung
- (wo)
-
Frankfurt am Main
- (wer)
-
Universitätsbibliothek Johann Christian Senckenberg
- (wann)
-
2009
- Urheber
-
Willig, Martina
- Beteiligte Personen und Organisationen
-
Schmidt-Schauß, Manfred
Sabel, David
- URN
-
urn:nbn:de:hebis:30-67958
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:48 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
- Willig, Martina
- Schmidt-Schauß, Manfred
- Sabel, David
- Universitätsbibliothek Johann Christian Senckenberg
Entstanden
- 2009
Ähnliche Objekte (12)
Program equivalence for a concurrent lambda calculus with futures
Constrained lambda calculus
Dynamic Lambda Calculus
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
The overtyped lambda calculus
Binary lambda calculus and combinatory logic
Category theory and the simply typed λ-calculus [lambda-calculus]
Abstract computing machines : a Lambda calculus perspective
Standard models of the overtyped lambda-calculus
Label dependent lambda calculus and gradual typing
A Coloured Version of the Lambda-Calculus
Program equivalence for a concurrent lambda calculus with futures
Constrained lambda calculus
Dynamic Lambda Calculus
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
The overtyped lambda calculus
Binary lambda calculus and combinatory logic
Category theory and the simply typed λ-calculus [lambda-calculus]
Abstract computing machines : a Lambda calculus perspective
Standard models of the overtyped lambda-calculus
Label dependent lambda calculus and gradual typing
A Coloured Version of the Lambda-Calculus
Program equivalence for a concurrent lambda calculus with futures
Constrained lambda calculus
Dynamic Lambda Calculus
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
The overtyped lambda calculus
Binary lambda calculus and combinatory logic
Category theory and the simply typed λ-calculus [lambda-calculus]
Abstract computing machines : a Lambda calculus perspective
Standard models of the overtyped lambda-calculus
Label dependent lambda calculus and gradual typing