A modal lambda calculus with iteration and case constructs

DOI10.1007/3-540-48167-2_4MaRDI QIDQ4944849zbMATH OpenFDO

Authors Pierre Leleu, J. Despeyroux

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_4

zbMATH Keywords

conservative extensionhigher-order abstract syntaxinductive typemodal \(\lambda\)-calculusoperators for iteration and case reasoningsimply-typed \(\lambda\)-calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• Recursion over objects of functional type
• scientific article; zbMATH DE number 1231474
• scientific article; zbMATH DE number 2185713
• scientific article; zbMATH DE number 1508934
• Primitive recursion for higher-order abstract syntax

Cited in

(5)

• Recursion over objects of functional type
• A mixed modal/linear lambda calculus with applications to Bellantoni-Cook safe recursion
• scientific article; zbMATH DE number 1231474 (Why is no real title available?)
• scientific article; zbMATH DE number 1508934 (Why is no real title available?)
• Bracket induction for Lambek calculus with bracket modalities

Describes a project that uses

Uses Software

• ALF

This page was built for publication: A modal lambda calculus with iteration and case constructs

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