Introduction to generalized type systems

DOI10.1017/S0956796800020025zbMATH Open1159.03304OpenAlexW2402296188WikidataQ63090394 ScholiaQ63090394MaRDI QIDQ4939699FDOQ4939699

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

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)