Add to ORKGEnglish version of my PhD thesis.We study the properties, in particular termination, of dependent types systems for lambda calculus and rewriting
Dependent types can make your developments (be they programs or proofs) dramatically safer by allowi...
This thesis is about the combination of lambda-calculus with rewriting. We mainly study two properti...
Modern programming languages rely on advanced type systems that detect errors at compile-time. While...
English version of my PhD thesis.We study the properties, in particular termination, of dependent ty...
english version: http://hal.inria.fr/inria-00105525/We study the properties, in particular terminati...
In the study of termination of reduction systems, the notion of types has played an important role. ...
International audienceDependency pairs are a key concept at the core of modern automated termination...
In this paper we extend the higher-order critical pair criterion, as described in [9], to the LF fra...
AbstractThe last few years have seen the development of a new calculus which can be considered as an...
International audienceThe last few years have seen the development of a new calculus which can be co...
Dependent type theory is a powerful logic for both secure programming and computer assisted proving ...
International audienceThe rewriting calculus (rho-calculus), is a minimal framework embedding lambda...
http://www.youtube.com/watch?v=SJaMtBKnN-IThis thesis is about rewriting in the typed lambda-calculu...
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
In the area of foundations of mathematics and computer science, three related topics dominate. Thes...
Dependent types can make your developments (be they programs or proofs) dramatically safer by allowi...
This thesis is about the combination of lambda-calculus with rewriting. We mainly study two properti...
Modern programming languages rely on advanced type systems that detect errors at compile-time. While...
English version of my PhD thesis.We study the properties, in particular termination, of dependent ty...
english version: http://hal.inria.fr/inria-00105525/We study the properties, in particular terminati...
In the study of termination of reduction systems, the notion of types has played an important role. ...
International audienceDependency pairs are a key concept at the core of modern automated termination...
In this paper we extend the higher-order critical pair criterion, as described in [9], to the LF fra...
AbstractThe last few years have seen the development of a new calculus which can be considered as an...
International audienceThe last few years have seen the development of a new calculus which can be co...
Dependent type theory is a powerful logic for both secure programming and computer assisted proving ...
International audienceThe rewriting calculus (rho-calculus), is a minimal framework embedding lambda...
http://www.youtube.com/watch?v=SJaMtBKnN-IThis thesis is about rewriting in the typed lambda-calculu...
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
In the area of foundations of mathematics and computer science, three related topics dominate. Thes...
Dependent types can make your developments (be they programs or proofs) dramatically safer by allowi...
This thesis is about the combination of lambda-calculus with rewriting. We mainly study two properti...
Modern programming languages rely on advanced type systems that detect errors at compile-time. While...