Search Results - "Blanqui, Frédéric"

Termination of rewrite relations on λ-terms based on Girard's notion of reducibility by Blanqui, Frédéric

“…In this paper, we show how to extend the notion of reducibility introduced by Girard for proving the termination of β-reduction in the polymorphic λ-calculus,…”
Get full text

Sharing proofs with predicative theories through universe-polymorphic elaboration by Felicissimo, Thiago, Blanqui, Frédéric

“…As the development of formal proofs is a time-consuming task, it is important to devise ways of sharing the already written proofs to prevent wasting time…”
Get full text

A modular construction of type theories by Blanqui, Frédéric, Dowek, Gilles, Grienenberger, Emilie, Hondet, Gabriel, Thiré, François

“…The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U,…”
Get full text

EKSTRAKTO A tool to reconstruct Dedukti proofs from TSTP files (extended abstract) by El Haddad, Mohamed Yacine, Burel, Guillaume, Blanqui, Frédéric

“…Proof assistants often call automated theorem provers to prove subgoals. However, each prover has its own proof calculus and the proof traces that it produces…”
Get full text

The computability path ordering by Blanqui, Frédéric, Jouannaud, Jean-Pierre, Rubio, Albert

“…This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce…”
Get full text

On the confluence of lambda-calculus with conditional rewriting by Blanqui, Frédéric, Kirchner, Claude, Riba, Colin

“…The confluence of untyped λ -calculus with unconditional rewriting is now well un- derstood. In this paper, we investigate the confluence of λ -calculus with…”
Get full text

Proceedings of the 13th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice: Preface by Blanqui, Frédéric, Reis, Giselle

Get full text

Sharing proofs with predicative theories through universe-polymorphic elaboration by Felicissimo, Thiago, Blanqui, Frédéric

“…Logical Methods in Computer Science, Volume 20, Issue 3 (September 10, 2024) lmcs:12213 As the development of formal proofs is a time-consuming task, it is…”
Get full text

Type safety of rewrite rules in dependent types by Blanqui, Frédéric

“…5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020), Jun 2020, Paris, France. pp.14 The expressiveness of dependent…”
Get full text

The New Rewriting Engine of Dedukti by Hondet, Gabriel, Blanqui, Frédéric

“…FSCD 2020 - 5th International Conference on Formal Structures for Computation and Deduction, Jun 2020, Paris, France. pp.16 Dedukti is a type-checker for the…”
Get full text

Encoding of Predicate Subtyping with Proof Irrelevance in the $\lambda$$\Pi$-Calculus Modulo Theory by Hondet, Gabriel, Blanqui, Frédéric

“…The $\lambda$$\Pi$-calculus modulo theory is a logical framework in which various logics and type systems can be encoded, thus helping the cross-verification…”
Get full text

Higher-order dependency pairs by Blanqui, Frédéric

“…Eighth International Workshop on Termination - WST 2006, Aug 2006, Seattle, United States. 2006 Arts and Giesl proved that the termination of a first-order…”
Get full text

Size-based termination of higher-order rewriting by Blanqui, Frédéric

“…We provide a general and modular criterion for the termination of simply-typed $\lambda$ -calculus extended with function symbols defined by user-defined…”
Get full text

Translating proofs from an impredicative type system to a predicative one by Felicissimo, Thiago, Blanqui, Frédéric, Barnawal, Ashish Kumar

“…As the development of formal proofs is a time-consuming task, it is important to devise ways of sharing the already written proofs to prevent wasting time…”
Get full text

Termination of $\lambda$$\Pi$ modulo rewriting using the size-change principle (work in progress) by Blanqui, Frédéric, Genestier, Guillaume

“…16th International Workshop on Termination, Jul 2018, Oxford, United Kingdom The Size-Change Termination principle was first introduced to study the…”
Get full text

Termination of rewrite relations on $\lambda$-terms based on Girard's notion of reducibility by Blanqui, Frédéric

“…In this paper, we show how to extend the notion of reducibility introduced by Girard for proving the termination of $\beta$-reduction in the polymorphic…”
Get full text

Proceedings of the 13th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice by Blanqui, Frédéric, Reis, Giselle

“…EPTCS 274, 2018 This volume contains a selection of papers presented at LFMTP 2018, the 13th international Workshop on Logical Frameworks and Meta-Languages:…”
Get full text

A modular construction of type theories by Blanqui, Frédéric, Dowek, Gilles, Grienenberger, Emilie, Hondet, Gabriel, Thiré, François

“…Logical Methods in Computer Science, Volume 19, Issue 1 (February 14, 2023) lmcs:8637 The lambda-Pi-calculus modulo theory is a logical framework in which many…”
Get full text

A point on fixpoints in posets by Blanqui, Frédéric

“…Let $(X,\le)$ be a {\em non-empty strictly inductive poset}, that is, a non-empty partially ordered set such that every non-empty chain $Y$ has a least upper…”
Get full text

Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting by Blanqui, Frédéric, Genestier, Guillaume, Hermant, Olivier

“…Dependency pairs are a key concept at the core of modern automated termination provers for first-order term rewriting systems. In this paper, we introduce an…”
Get full text