Abstract. Infinite multi-bases can have infinite and multiple type declarations for the same variable. They can be used as a proof-technique to manipulate only one common basis along the proof. However, no proper definition and precise study of typed lambda calculus with infinite multi-bases appear in the literature. This paper introduces type assignment systems with infinite multi-bases and studies the basic meta-theoretic properties. As an application of our study of multi-bases, we prove that a function on λ-terms satisfies the type semantics property if and only if this function defines a λ structure which coincides with the usual filter structure
We study the type inference problem for the Soft Type Assignment system (STA) for lambda-calculus in...
Abstract. Infinite lambda calculi extend finite lambda calculus with infinite terms and transfinite ...
AbstractA λ-language over a simple type structure is considered. Type B = (O → O) → ((O → O) → (O → ...
AbstractRecent work on infinitary versions of the lambda calculus has shown that the infinite lambda...
Recent work on infinitary versions of the lambda calculus has shown that the infinite lambda calculu...
In the area of foundations of mathematics and computer science, three related topics dominate. These...
. We show that infinite objects can be constructively understood without the consideration of partia...
We address a problem connected to the unfolding semantics of functional programming languages: give ...
We show how the subtype relation of the well-known system Fsub, the second-order polymorphic lambda-...
We present a definition of untyped l-terms using a heterogeneous datatype, i.e. an inductively defin...
AbstractIn this paper we study type inference systems for λ-calculus with a recursion operator over ...
This paper proves undecidability of type checking and type inference problems in some variants of ty...
AbstractRules for assigning type-schemes to untyped λ-terms are given, three different semantics are...
The lambda-Pi-calculus modulo theory is a logical framework in which manytype systems can be express...
untyped lambda calculus was introduced around 1930 by Church [11] as part of an investigation in the...
We study the type inference problem for the Soft Type Assignment system (STA) for lambda-calculus in...
Abstract. Infinite lambda calculi extend finite lambda calculus with infinite terms and transfinite ...
AbstractA λ-language over a simple type structure is considered. Type B = (O → O) → ((O → O) → (O → ...
AbstractRecent work on infinitary versions of the lambda calculus has shown that the infinite lambda...
Recent work on infinitary versions of the lambda calculus has shown that the infinite lambda calculu...
In the area of foundations of mathematics and computer science, three related topics dominate. These...
. We show that infinite objects can be constructively understood without the consideration of partia...
We address a problem connected to the unfolding semantics of functional programming languages: give ...
We show how the subtype relation of the well-known system Fsub, the second-order polymorphic lambda-...
We present a definition of untyped l-terms using a heterogeneous datatype, i.e. an inductively defin...
AbstractIn this paper we study type inference systems for λ-calculus with a recursion operator over ...
This paper proves undecidability of type checking and type inference problems in some variants of ty...
AbstractRules for assigning type-schemes to untyped λ-terms are given, three different semantics are...
The lambda-Pi-calculus modulo theory is a logical framework in which manytype systems can be express...
untyped lambda calculus was introduced around 1930 by Church [11] as part of an investigation in the...
We study the type inference problem for the Soft Type Assignment system (STA) for lambda-calculus in...
Abstract. Infinite lambda calculi extend finite lambda calculus with infinite terms and transfinite ...
AbstractA λ-language over a simple type structure is considered. Type B = (O → O) → ((O → O) → (O → ...