Introduction to generalized type systems

DOI10.1017/S0956796800020025zbMath1159.03304OpenAlexW2402296188WikidataQ63090394 ScholiaQ63090394MaRDI QIDQ4939699

Hendrik Pieter 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

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

Related Items (17)

Self-quotation in a typed, intensional lambda-calculus ⋮ Open problems in rewriting ⋮ Problems in rewriting III ⋮ The metatheory of UTT ⋮ Developing certified programs in the system Coq the program tactic ⋮ Codifying guarded definitions with recursive schemes ⋮ First among equals: co-hyperintensionality for structured propositions ⋮ On the Semantics of Intensionality ⋮ A Type Theory for Probabilistic $$\lambda $$–calculus ⋮ Intensional computation with higher-order functions ⋮ The self-reduction in lambda calculus ⋮ Programs as data structures in \(\lambda\)SF-calculus ⋮ Is Impredicativity Implicitly Implicit ⋮ The Implicit Calculus of Constructions as a Programming Language with Dependent Types ⋮ The development of a partial evaluator for extended lambda calculus ⋮ Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms ⋮ Constructive proofs of the range property in lambda calculus

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