NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login
Back to Results
Explicit Substitutions and All ThatExplicit substitution calculi are extensions of the lambda-calculus where the substitution mechanism is internalized into the theory. This feature makes them suitable for implementation and theoretical study of logic-based tools such as strongly typed programming languages and proof assistant systems. In this paper we explore new developments on two of the most successful styles of explicit substitution calculi: the lambda sigma- and lambda S(e)-calculi.
Document ID
20010020251
Acquisition Source
Headquarters
Document Type
Contractor Report (CR)
Authors
Ayala-Rincon, Mauricio
Munoz, Cesar
Date Acquired
September 7, 2013
Publication Date
November 1, 2000
Subject Category
Computer Programming And Software
Report/Patent Number
NASA-CR-2000-210621
ICASE-2000-45
AD-A385383
Funding Number(s)
CONTRACT_GRANT: NAS1-97046
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Related Records

There are no records associated with this record.
No Preview Available