In this paper we revisit the λ-calculus with patterns, originating from the practice of functional programming language design. We treat this feature in a framework ranging from pure λ-calculus to orthogonal combinatory reduction systems. © 2008
In this master thesis we investigate lambda calculus and the theory of combinatory logic. Two comput...
20 pagesThe pure pattern calculus generalises the pure lambda-calculus by basing computation on patt...
This work gives some insights and results on standardisation for call-by-name pattern calculi. More ...
AbstractIn this paper we revisit the λ-calculus with patterns, originating from the practice of func...
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pa...
We introduce a concept of computability relative to a structure, which specifies which functions on ...
Abstract. In this paper we propose a Weak Lambda Calculus called λPw having explicit operators for P...
untyped lambda calculus was introduced around 1930 by Church [11] as part of an investigation in the...
AbstractAn implementation oriented modification of lambda-calculus is presented together with some a...
AbstractLambda-SF-calculus can represent programs as closed normal forms. In turn, all closed normal...
The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathemati...
International audienceWe present an extension of the lambda(eta)-calculus with a case construct that...
International audienceThis paper introduces Hilbert systems for λ-calculus, called sequent combinato...
International audienceDifferent pattern calculi integrate the functional mechanisms from the lambda-...
Church's lambda-calculus is modified by introducing a new mechanism, the lambda-bar operator #, whic...
In this master thesis we investigate lambda calculus and the theory of combinatory logic. Two comput...
20 pagesThe pure pattern calculus generalises the pure lambda-calculus by basing computation on patt...
This work gives some insights and results on standardisation for call-by-name pattern calculi. More ...
AbstractIn this paper we revisit the λ-calculus with patterns, originating from the practice of func...
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pa...
We introduce a concept of computability relative to a structure, which specifies which functions on ...
Abstract. In this paper we propose a Weak Lambda Calculus called λPw having explicit operators for P...
untyped lambda calculus was introduced around 1930 by Church [11] as part of an investigation in the...
AbstractAn implementation oriented modification of lambda-calculus is presented together with some a...
AbstractLambda-SF-calculus can represent programs as closed normal forms. In turn, all closed normal...
The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathemati...
International audienceWe present an extension of the lambda(eta)-calculus with a case construct that...
International audienceThis paper introduces Hilbert systems for λ-calculus, called sequent combinato...
International audienceDifferent pattern calculi integrate the functional mechanisms from the lambda-...
Church's lambda-calculus is modified by introducing a new mechanism, the lambda-bar operator #, whic...
In this master thesis we investigate lambda calculus and the theory of combinatory logic. Two comput...
20 pagesThe pure pattern calculus generalises the pure lambda-calculus by basing computation on patt...
This work gives some insights and results on standardisation for call-by-name pattern calculi. More ...
DOI
Add to ORKG