scientific article
From MaRDI portal
Publication:3997125
zbMath0716.68007MaRDI QIDQ3997125
No author found.
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
logic programminglambda calculusCurry-Howard isomorphismrecursion theoryautomated deductionComputer Sciencepolymorphism. type theory
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (16)
Intersection types for explicit substitutions ⋮ Algebraic domains of natural transformations ⋮ Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds ⋮ Higher-order subtyping and its decidability ⋮ Higher-order subtyping ⋮ \(\lim +, \delta^+\), and non-permutability of \(\beta\)-steps ⋮ The Recursion Scheme from the Cofree Recursive Comonad ⋮ Strong normalization from an unusual point of view ⋮ Linearizing intuitionistic implication ⋮ The emptiness problem for intersection types ⋮ Least and greatest fixed points in intuitionistic natural deduction ⋮ Unification with extended patterns ⋮ Encoding Generic Judgments ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models ⋮ Set-theoretical and other elementary models of the \(\lambda\)-calculus ⋮ Synthesis of ML programs in the system Coq
Uses Software
This page was built for publication:
