Revisiting the notion of function

DOI10.1016/S1567-8326(02)00016-4MaRDI QIDQ1394989zbMATH OpenFDO

Authors Fairouz Kamareddine, Twan Laan, Rob Nederpelt

Publication date 25 June 2003

Published in The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

zbMATH Keywords

\(\lambda\)-calculusAutomathexplicit substitutioninstantiation\(\Pi\)-reductionBarendregt cubefunction abstractionfunctionalisation

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• On functions and types: a tutorial
• Automath type inclusion in Barendregt's cube
• scientific article; zbMATH DE number 1692907
• A unified approach to type theory through a refined -calculus
• scientific article; zbMATH DE number 599579

Cites work

• scientific article; zbMATH DE number 1692907 (Why is no real title available?)
• scientific article; zbMATH DE number 3735770 (Why is no real title available?)
• scientific article; zbMATH DE number 108434 (Why is no real title available?)
• scientific article; zbMATH DE number 3485174 (Why is no real title available?)
• scientific article; zbMATH DE number 3624817 (Why is no real title available?)
• scientific article; zbMATH DE number 1062114 (Why is no real title available?)
• scientific article; zbMATH DE number 1070568 (Why is no real title available?)
• scientific article; zbMATH DE number 194911 (Why is no real title available?)
• scientific article; zbMATH DE number 3993540 (Why is no real title available?)
• scientific article; zbMATH DE number 3291106 (Why is no real title available?)
• scientific article; zbMATH DE number 3331288 (Why is no real title available?)
• A set of postulates for the foundation of logic. II
• A useful \(\lambda\)-notation
• Canonical typing and ∏-conversion in the Barendregt Cube
• Combinatory logic. With two sections by William Craig.
• Constructive natural deduction and its ‘ω-set’ interpretation
• Explicit substitutions
• On \(\Pi\)-conversion in the \(\lambda\)-cube and the combination with abbreviations
• Pure type systems with explicit substitution
• Selected papers on AUTOMATH, dedicated to N. G. de Bruijn
• Strictness analysis via abstract interpretation for recursively defined types
• The Barendregt cube with definitions and generalised reduction
• The calculus of constructions
• The lambda calculus. Its syntax and semantics. Rev. ed.
• λν, a calculus of explicit substitutions which preserves strong normalisation

Cited in

(5)

• Automath and Pure Type Systems
• On functions and types: a tutorial
• Automath type inclusion in Barendregt's cube
• scientific article; zbMATH DE number 2079264 (Why is no real title available?)
• Russell's 1903 - 1905 Anticipation of the Lambda Calculus

Describes a project that uses

Uses Software

• ML
• Automath

This page was built for publication: Revisiting the notion of function

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