Partial Applicative Theories and Explicit Substitutions

DOI10.1093/LOGCOM/6.1.55MaRDI QIDQ4870067zbMATH OpenOpenAlexFDO

Authors 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

explicit mathematicsexplicit substitutionslogic of partial termspartial \(\lambda\) calculuspartial combinatory logic

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1500649
• scientific article; zbMATH DE number 1418436
• A Theory of Explicit Substitutions with Safe and Full Composition
• scientific article; zbMATH DE number 1223735

Cited in

(11)

• A note on complexity measures for inductive classes in constructive type theory
• A theory of rules for enumerated classes of functions
• Universes over Frege structures
• Totality in applicative theories
• Remarks on applicative theories
• scientific article; zbMATH DE number 3937175 (Why is no real title available?)
• scientific article; zbMATH DE number 1418436 (Why is no real title available?)
• Explicit substitutions with de bruijn's levels
• Effective applicative structures
• The Rule of Existential Generalisation and Explicit Substitution
• Explicit mathematics: power types and overloading

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4870067)