Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
SEKI report ; 93,14
- Ereignis
-
Veröffentlichung
- (wo)
-
Kaiserslautern
- (wer)
-
Technische Universität Kaiserslautern, Fachbereich Informatik
- (wann)
-
1999
- Urheber
- URN
-
urn:nbn:de:hbz:386-kluedo-3231
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
17.05.0003, 16:59 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
- Johann, Patricia
- Kohlhase, Michael
- Technische Universität Kaiserslautern, Fachbereich Informatik
Entstanden
- 1999
Ähnliche Objekte (12)
Unification in a Sorted (lambda)-Calculus with Term Declarations and Function Sorts
Constrained lambda calculus
Dynamic Lambda Calculus
The overtyped lambda calculus
Binary lambda calculus and combinatory logic
On lambda binding constraints and context unification
Category theory and the simply typed λ-calculus [lambda-calculus]
Computing overlappings by unification in the deterministic lambda calculus LR with letrec, case, constructors, seq and variable chains
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
Unification in a Sorted (lambda)-Calculus with Term Declarations and Function Sorts
Constrained lambda calculus
Dynamic Lambda Calculus
The overtyped lambda calculus
Binary lambda calculus and combinatory logic
On lambda binding constraints and context unification
Category theory and the simply typed λ-calculus [lambda-calculus]
Computing overlappings by unification in the deterministic lambda calculus LR with letrec, case, constructors, seq and variable chains
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
Unification in a Sorted (lambda)-Calculus with Term Declarations and Function Sorts
Constrained lambda calculus
Dynamic Lambda Calculus
The overtyped lambda calculus
Binary lambda calculus and combinatory logic
On lambda binding constraints and context unification
Category theory and the simply typed λ-calculus [lambda-calculus]
Computing overlappings by unification in the deterministic lambda calculus LR with letrec, case, constructors, seq and variable chains
Abstract computing machines : a Lambda calculus perspective
Standard models of the overtyped lambda-calculus
Label dependent lambda calculus and gradual typing