Alexandre Miquel

Orcid: 0000-0003-2853-6862

According to our database1, Alexandre Miquel authored at least 21 papers between 2000 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Cut elimination for Zermelo set theory.
CoRR, 2023

Relative normalization.
CoRR, 2023

Implicative models of set theory.
Proceedings of the 39th Conference on the Mathematical Foundations of Programming Semantics, 2023

2020
Implicative algebras: a new foundation for realizability and forcing.
Math. Struct. Comput. Sci., 2020

2019
Realizability in the Unitary Sphere.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2017
Ordered combinatory algebras and realizability.
Math. Struct. Comput. Sci., 2017

2016
Specifying Peirce's law in classical realizability.
Math. Struct. Comput. Sci., 2016

2011
Existential witness extraction in classical realizability and via a negative translation
Log. Methods Comput. Sci., 2011

A Survey of Classical Realizability.
Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011

Forcing as a Program Transformation.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010
Specifying Imperative ML-Like Programs Using Dynamic Logic.
Proceedings of the Formal Verification of Object-Oriented Software, 2010

2009
The lambda-calculus with constructors: Syntax, confluence and separation.
J. Funct. Program., 2009

Relating Classical Realizability and Negative Translation for Existential Witness Extraction.
Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

2008
Classical F<sub>omega</sub>, orthogonality and symmetric candidates.
Ann. Pure Appl. Log., 2008

2007
Classical Program Extraction in the Calculus of Constructions.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006
A Lambda-Calculus with Constructors.
Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

2004
lamda-Z: Zermelo's Set Theory as a PTS with 4 Sorts.
Proceedings of the Types for Proofs and Programs, International Workshop, 2004

2003
A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002
The Not So Simple Proof-Irrelevant Model of CC.
Proceedings of the Types for Proofs and Programs, Second International Workshop, 2002

2001
The Implicit Calculus of Constructions.
Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

2000
A Model for Impredicative Type Systems, Universes, Intersection Types and Subtyping.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000


  Loading...