Partial Applicative Theories and Explicit Substitutions

DOI10.1093/logcom/6.1.55zbMath0841.03005OpenAlexW2021694631MaRDI QIDQ4870067

Thomas Strahm

Publication date: 9 May 1996

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://boris.unibe.ch/115274/1/6-1-55.pdf

zbMATH Keywords

logic of partial termsexplicit mathematicsexplicit substitutionspartial combinatory logicpartial \(\lambda\) calculus

Mathematics Subject Classification ID

Metamathematics of constructive systems (03F50) Combinatory logic and lambda calculus (03B40)

Related Items (7)

Explicit substitutions with de bruijn's levels ⋮ Effective applicative structures ⋮ Totality in applicative theories ⋮ Explicit mathematics: power types and overloading ⋮ A theory of rules for enumerated classes of functions ⋮ A note on complexity measures for inductive classes in constructive type theory ⋮ Universes over Frege structures

This page was built for publication: Partial Applicative Theories and Explicit Substitutions