|
Semantics for classical AUTOMATH and related systems Barendregt H. (ed), Rezus A. Information and Control 59(1-3): 127-147, 1984. Type: Article
The AUTOMATH family of languages can be viewed as typed lambda-calculi. The type structures are parameterized and highly complex, as befits the fact that propositions are types, the elements of which are the proofs of that proposition....
|
Sep 1 1985 |