Add to ORKGParallelism and non-determinism are fundamental concepts in the process algebra theory. Combining them with lambda-calculus can enlighten the theory of higher-order process algebras. In recent papers an analysis of a lambda-calculus containing parallel and non-deterministic operators was carried on by means of a type assignment system with intersection and union types. The present paper answers the problem of determining principal types for this system
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculu...
Abstract. A typed lambda calculus with recursion in all finite types is defined such that the first ...
This paper introduces a notion of intersection type assignment on the Lambda Calculus that is a rest...
Abstract. We recently introduced an extensional model of the pure -calculus living in a canonical ca...
Type-free lazy lambda-calculus is enriched with angelic parallelism and demonic nondeterminism. Call...
We study a l-calculus enriched with a non-deterministic choice combinator. We show that this combina...
We show that there are connections between principal type schemata, cut-free ?-nets, and normal form...
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...
AbstractThe completeness of Curry's rules for assigning type schemes to terms of the pure lambda-cal...
In Proceedings DCM 2011, arXiv:1207.6821International audienceWe describe a type system for the line...
AbstractWe aim at investigating the intersection-type assignment system for lambda calculus, with th...
We introduce an intersection type system for the lambda-mu calculus that isinvariant under subject r...
ElementaryAffineLogic(EAL)isavariantofLinearLogiccharacterizingthecomputa- tional power of the eleme...
In this paper we present a non-deterministic call-by-need (untyped) lambda calculus lambda nd with a...
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculu...
Abstract. A typed lambda calculus with recursion in all finite types is defined such that the first ...
This paper introduces a notion of intersection type assignment on the Lambda Calculus that is a rest...
Abstract. We recently introduced an extensional model of the pure -calculus living in a canonical ca...
Type-free lazy lambda-calculus is enriched with angelic parallelism and demonic nondeterminism. Call...
We study a l-calculus enriched with a non-deterministic choice combinator. We show that this combina...
We show that there are connections between principal type schemata, cut-free ?-nets, and normal form...
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...
AbstractThe completeness of Curry's rules for assigning type schemes to terms of the pure lambda-cal...
In Proceedings DCM 2011, arXiv:1207.6821International audienceWe describe a type system for the line...
AbstractWe aim at investigating the intersection-type assignment system for lambda calculus, with th...
We introduce an intersection type system for the lambda-mu calculus that isinvariant under subject r...
ElementaryAffineLogic(EAL)isavariantofLinearLogiccharacterizingthecomputa- tional power of the eleme...
In this paper we present a non-deterministic call-by-need (untyped) lambda calculus lambda nd with a...
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculu...
Abstract. A typed lambda calculus with recursion in all finite types is defined such that the first ...
This paper introduces a notion of intersection type assignment on the Lambda Calculus that is a rest...