Partial Applicative Theories and Explicit Substitutions

DOI10.1093/LOGCOM/6.1.55zbMATH Open0841.03005OpenAlexW2021694631MaRDI QIDQ4870067FDOQ4870067

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

Recommendations

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

zbMATH Keywords

explicit mathematicsexplicit substitutionslogic of partial termspartial combinatory logicpartial \(\lambda\) calculus

Mathematics Subject Classification ID

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

Cited In (11)

• Universes over Frege structures
• Title not available (Why is that?)
• Effective applicative structures
• Explicit substitutions with de bruijn's levels
• A note on complexity measures for inductive classes in constructive type theory
• Explicit mathematics: power types and overloading
• Totality in applicative theories
• Remarks on applicative theories
• Title not available (Why is that?)
• The Rule of Existential Generalisation and Explicit Substitution
• A theory of rules for enumerated classes of functions

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)