Singleton, union, and intersection types for program extraction
From MaRDI portal
Publication:1322477
DOI10.1006/inco.1994.1016zbMath0804.68091OpenAlexW2116636571MaRDI QIDQ1322477
Publication date: 5 May 1994
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1994.1016
Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40)
Related Items
Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models ⋮ Manifest Fields and Module Mechanisms in Intensional Type Theory ⋮ Intersection and singleton type assignment characterizing finite Böhm-trees ⋮ Lightweight Static Capabilities ⋮ \(QPC_ 2\): A constructive calculus with parameterized specifications
Uses Software