International audienceWe present in this paper an encoding in an extension with rewriting of the Edimburgh Logical Framework (LF) [Harper et al., 1993] of two common features: universe polymorphism and eta-convertibility. This encoding is at the root of the translator between Agda and Dedukti developped by the author
Agda, a promising dependently typed function language, needs more mainstream adoption. By the proces...
Agda allows for writing code that can be mathematically proven and verified to be correct, this type...
SIGLEAvailable from British Library Document Supply Centre- DSC:8724.845(UCMS--93-6-4) / BLDSC - Bri...
We present in this paper an encoding in an extension with rewriting of the Edimburgh Logical Framewo...
International audienceCoinduction is a principle, or a proof technique, dual to induction and which ...
Dedukti is a logical framework in which the user encodes the theory she wantsto use via rewriting ru...
This Agda code contains a formal development of some of the proofs in the paper Ian Orton and Andrew...
International audienceAs the development of formal proofs is a time-consuming task, it is important ...
This dissertation describes a novel approach to safe meta-programming. A meta-program is a program w...
We develop a theoretical foundation for compiling the programming language Agda to System Fω, which ...
Datatype-generic programming is natural and useful in dependently typed languages such as Agda. Howe...
Agda code accompanying the article ‘Programming metamorphic algorithms: An experiment in type-driven...
Datatype-generic programming is natural and useful in dependently typed languages such as Agda. Howe...
We consider encodings in polymorphism with finite product types. These encodings are given in terms ...
International audienceDedukti is a very expressive logical framework which unlike most frameworks, s...
Agda, a promising dependently typed function language, needs more mainstream adoption. By the proces...
Agda allows for writing code that can be mathematically proven and verified to be correct, this type...
SIGLEAvailable from British Library Document Supply Centre- DSC:8724.845(UCMS--93-6-4) / BLDSC - Bri...
We present in this paper an encoding in an extension with rewriting of the Edimburgh Logical Framewo...
International audienceCoinduction is a principle, or a proof technique, dual to induction and which ...
Dedukti is a logical framework in which the user encodes the theory she wantsto use via rewriting ru...
This Agda code contains a formal development of some of the proofs in the paper Ian Orton and Andrew...
International audienceAs the development of formal proofs is a time-consuming task, it is important ...
This dissertation describes a novel approach to safe meta-programming. A meta-program is a program w...
We develop a theoretical foundation for compiling the programming language Agda to System Fω, which ...
Datatype-generic programming is natural and useful in dependently typed languages such as Agda. Howe...
Agda code accompanying the article ‘Programming metamorphic algorithms: An experiment in type-driven...
Datatype-generic programming is natural and useful in dependently typed languages such as Agda. Howe...
We consider encodings in polymorphism with finite product types. These encodings are given in terms ...
International audienceDedukti is a very expressive logical framework which unlike most frameworks, s...
Agda, a promising dependently typed function language, needs more mainstream adoption. By the proces...
Agda allows for writing code that can be mathematically proven and verified to be correct, this type...
SIGLEAvailable from British Library Document Supply Centre- DSC:8724.845(UCMS--93-6-4) / BLDSC - Bri...
DOI
Add to ORKG