Search Results - "simply typed lambda-calculus"

On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus by Kobayashi, Naoki

“…The decidability of the reachability problem for finitary PCF has been used as a theoretical basis for fully automated verification tools for functional…”
Get full text

Extensional proofs in a propositional logic modulo isomorphisms by Díaz-Caro, Alejandro, Dowek, Gilles

“…System I is a proof language for a fragment of propositional logic where isomorphic propositions, such as A∧B and B∧A, or A⇒(B∧C) and (A⇒B)∧(A⇒C) are made…”
Get full text

Higher-order pattern generalization modulo equational theories by Cerna, David M., Kutsia, Temur

“…We consider anti-unification for simply typed lambda terms in theories defined by associativity, commutativity, identity (unit element) axioms and their…”
Get full text

On Correspondence between Selective CPS Transformation and Selective Double Negation Translation by Im, Hyeonseung

“…A double negation translation (DNT) embeds classical logic into intuitionistic logic. Such translations correspond to continuation passing style (CPS)…”
Get full text

Krivine machines and higher-order schemes by Salvati, Sylvain, Walukiewicz, Igor

“…We propose a new approach to analyzing higher-order recursive schemes. Many results in the literature use automata models generalizing pushdown automata, most…”
Get full text

The IO and OI hierarchies revisited by Kobele, Gregory M., Salvati, Sylvain

“…We study languages of λ-terms generated by IO and OI unsafe grammars. These languages can be used to model meaning representations in the formal semantics of…”
Get full text

Using models to model-check recursive schemes by Salvati, Sylvain, Walukiewicz, Igor

“…We propose a model-based approach to the model checking problem for recursive schemes. Since simply typed lambda calculus with the fixpoint operator,…”
Get full text

Statman's Hierarchy Theorem by Westerbaan, Bram, Westerbaan, Bas, Kuyper, Rutger, Tankink, Carst, Viehoff, Remy, Barendregt, Henk

“…In the Simply Typed $\lambda$-calculus Statman investigates the reducibility relation $\leq_{\beta\eta}$ between types: for $A,B \in \mathbb{T}^0$, types…”
Get full text

An alternate proof of Statmanʼs finite completeness theorem by Srivathsan, B., Walukiewicz, Igor

“…Statmanʼs finite completeness theorem says that for every pair of non-equivalent terms of simply-typed lambda-calculus there is a model that separates them. A…”
Get full text

The correctness of Newman’s typability algorithm and some of its extensions by Geuvers, Herman, Krebbers, Robbert

“…We study Newman’s typability algorithm (Newman, 1943) [14] for simple type theory. The algorithm originates from 1943, but was left unnoticed until (Newman,…”
Get full text

A Provably Correct Translation of the λ-Calculus into a Mathematical Model of C++ by Abdul Rauf, Rose H., Berger, Ulrich, Setzer, Anton

“…We introduce a translation of the simply typed λ -calculus into C++, and give a mathematical proof of the correctness of this translation. For this purpose we…”
Get full text

Decidability of bounded higher-order unification by Schmidt-Schauß, Manfred, Schulz, Klaus U.

“…It is shown that unifiability of terms in the simply typed lambda calculus with β and η rules becomes decidable if there is a bound on the number of bound…”
Get full text

Decidability of behavioural equivalence in unary PCF by Schmidt-Schauß, Manfred

“…Unary PCF is a fragment of the simply typed lambda-calculus PCF. We present a short proof that behavioral equivalence in unary PCF is decidable. An algorithm…”
Get full text

Monotone Majorizable Functionals by Schwichtenberg, Helmut

“…Several properties of monotone functionals (MF) and monotone majorizable functionals (MMF) used in the earlier work by the author and van de Pol are proved. It…”
Get full text