scientific article; zbMATH DE number 194511
From MaRDI portal
Publication:4692468
zbMath0709.68003MaRDI QIDQ4692468
No author found.
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polymorphismconstructive type theoryLogical foundations of functional programmingtyped \(\lambda \) -calculus. categorical abstract machine
Proceedings, conferences, collections, etc. pertaining to computer science (68-06) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)
Related Items (19)
Simple type inference for term graph rewriting systems ⋮ From Logic to Functional Logic Programs ⋮ Problems in rewriting applied to categorical concepts by the example of a computational comonad ⋮ Problems in rewriting III ⋮ An extension of system F with subtyping ⋮ New Curry-Howard terms for full linear logic ⋮ A new framework for declarative programming ⋮ Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves ⋮ On the adequacy of representing higher order intuitionistic logic as a pure type system ⋮ Proof search with set variable instantiation in the Calculus of Constructions ⋮ Comparing Hagino's categorical programming language and typed lambda- calculi ⋮ Computational interpretations of linear logic ⋮ Independence of the induction principle and the axiom of choice in the pure calculus of constructions ⋮ On the algebraic structure of declarative programming languages ⋮ The calculus of constructions as a framework for proof search with set variable instantiation ⋮ Proof-search in type-theoretic languages: An introduction ⋮ Basic theory of \(F\)-bounded quantification. ⋮ Combinatory reduction systems: Introduction and survey ⋮ A coinductive completeness proof for the equivalence of recursive types
This page was built for publication:
