Conjunctive types and SKInT

DOI10.1007/3-540-48167-2_8MaRDI QIDQ4944853zbMATH OpenFDO

Authors Jean Goubault-Larrecq

Publication date 5 September 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48167-2_8

zbMATH Keywords

\(\lambda\)-calculusfirst-order languagereductionrewrite systemweak normalization

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Grammars and rewriting systems (68Q42)

Recommendations

• Strong normalization of substitutions
• A -calculus with explicit weakening and explicit substitution
• Sequent combinators: a Hilbert system for the lambda calculus
• \(\lambda\)-calculi with explicit substitutions preserving strong normalization
• Reductions, intersection types, and explicit substitutions

Cited in

(1)

• SK implementation of some data types

This page was built for publication: Conjunctive types and SKInT

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