To perform higher-order matching, we need to decide the beta eta-equivalence on \lambda-terms. The first way to do it is to use simply typed lambda-calculus and this is the usual framework where higher-order matching is performed. Another approach consists in deciding a restricted equivalence based on finite superdevelopments. We consider higher-order matching modulo this equivalence over untyped lambda-terms for which we propose a terminating, sound and complete matching algorithm. This is in particular of interest since all second-order beta-matches are matches modulo superdevelopments. We further propose a restriction to second-order matching that gives exactly all second-order matches
Inspired by a recent graphical formalism for lambda-calculus based on Linear Logic technology, we in...
International audienceSuperposition is among the most successful calculi for first-order logic. Its ...
International audienceWe introduce the permutative lambda-calculus, an extension of lambda-calculus ...
To perform higher-order matching, we need to decide the beta eta-equivalence on lambda-terms. The fi...
Higher-order matching is a special case of unification of simply-typed lambda-terms: in a matching e...
International audienceWe designed a superposition calculus for a clausal fragment of extensional pol...
1. We analyze expressiveness of the simply typed lambda calculus (STLC) over a single base type, and...
International audienceWe extend the termination proof methods based on reduction orderings to higher...
International audienceWe introduce refutationally complete superposition calculi for intentional and...
AbstractWe present a simple, practical algorithm for higher-order matching in the context of automat...
(avec annexes)International audienceWe present an extension of the lambda(eta)-calculus with a case ...
International audienceWe recently designed two calculi as stepping stones towards superposition for ...
Colloque avec actes et comité de lecture. internationale.International audienceWe consider the probl...
AbstractWe define the typed lambda calculus Fω∧ (F-omega-meet), a natural generalization of Girard's...
The rewriting calculus, also called the rho-calculus, is a generalisation of the lambda-calculus wit...
Inspired by a recent graphical formalism for lambda-calculus based on Linear Logic technology, we in...
International audienceSuperposition is among the most successful calculi for first-order logic. Its ...
International audienceWe introduce the permutative lambda-calculus, an extension of lambda-calculus ...
To perform higher-order matching, we need to decide the beta eta-equivalence on lambda-terms. The fi...
Higher-order matching is a special case of unification of simply-typed lambda-terms: in a matching e...
International audienceWe designed a superposition calculus for a clausal fragment of extensional pol...
1. We analyze expressiveness of the simply typed lambda calculus (STLC) over a single base type, and...
International audienceWe extend the termination proof methods based on reduction orderings to higher...
International audienceWe introduce refutationally complete superposition calculi for intentional and...
AbstractWe present a simple, practical algorithm for higher-order matching in the context of automat...
(avec annexes)International audienceWe present an extension of the lambda(eta)-calculus with a case ...
International audienceWe recently designed two calculi as stepping stones towards superposition for ...
Colloque avec actes et comité de lecture. internationale.International audienceWe consider the probl...
AbstractWe define the typed lambda calculus Fω∧ (F-omega-meet), a natural generalization of Girard's...
The rewriting calculus, also called the rho-calculus, is a generalisation of the lambda-calculus wit...
Inspired by a recent graphical formalism for lambda-calculus based on Linear Logic technology, we in...
International audienceSuperposition is among the most successful calculi for first-order logic. Its ...
International audienceWe introduce the permutative lambda-calculus, an extension of lambda-calculus ...