Introduction to generalized type systems

DOI10.1017/S0956796800020025MaRDI QIDQ4939699zbMATH OpenOpenAlexWikidataFDO

Authors Henk Barendregt

Publication date 9 February 2000

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0956796800020025

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Cited in

(17)

• Intensional computation with higher-order functions
• The development of a partial evaluator for extended lambda calculus
• Open problems in rewriting
• Codifying guarded definitions with recursive schemes
• The self-reduction in lambda calculus
• Developing certified programs in the system Coq the program tactic
• A Type Theory for Probabilistic $$\lambda $$–calculus
• First among equals: co-hyperintensionality for structured propositions
• The metatheory of UTT
• On the semantics of intensionality
• Constructive proofs of the range property in lambda calculus
• Self-quotation in a typed, intensional lambda-calculus
• Is Impredicativity Implicitly Implicit
• Problems in rewriting III
• Programs as data structures in \(\lambda\)SF-calculus
• Deriving efficient sequential and parallel generators for closed simply-typed lambda terms and normal forms
• The Implicit Calculus of Constructions as a Programming Language with Dependent Types

This page was built for publication: Introduction to generalized type systems

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