A self-dependency constraint in the simply typed lambda calculus

Authors:
Aleksy Schubert
Affiliations:
Institute of Informatics, Warsaw University, Warsaw, Poland
Venue:
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Year:
2005

Citing 8
Cited 1

Decidability of behavioural equivalence in unary PCF

Theoretical Computer Science
Finitary PCF is not decidable

Theoretical Computer Science
On Equivalence Classes of Interpolation Equations

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
HOL Light: A Tutorial Introduction

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Decidability of All Minimal Models

TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
Linear Higher-Order Matching Is NP-Complete

RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
A Decidable Variant of Higher Order Matching

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Decidability of Bounded Higher-Order Unification

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic

Higher-order beta matching with solutions in long beta-eta normal form

Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a class of terms in the simply typed lambda calculus in which initially, during reduction, and for the potential terms it is never allowed that a variable x is applied to an argument containing x. The terms form a wide class which includes linear terms. We show that corresponding variant of the dual interpolation problem (i.e. the problem in which all expressions can be restricted to terms of this kind) is decidable. Thus the model for this kind of expressions can admit fully abstract semantics and the higher-order matching problem is decidable.