scientific article; zbMATH DE number 1354162
From MaRDI portal
Publication:4268477
zbMath0925.03149MaRDI QIDQ4268477
Publication date: 28 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)
Related Items (12)
The Inf function in the system \(F\) ⋮ Monotone recursive types and recursive data representations in Cedille ⋮ Efficiency of lambda-encodings in total type theory ⋮ The calculus of dependent lambda eliminations ⋮ Unnamed Item ⋮ Recursive programming with proofs ⋮ Some Remarks on Type Systems for Course-of-value Recursion ⋮ A Tutorial on Type-Based Termination ⋮ On the confluence of lambda-calculus with conditional rewriting ⋮ Strong storage operators and data types ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models ⋮ Minimality in a Linear Calculus with Iteration
This page was built for publication:
