Stop the war!
Остановите войну!
for scientists:
default search action
Logical Methods in Computer Science, Special Issue 23
Special Issue: Types for Proofs and Programs, 2010 [TYPES 2010]
- Cyril Cohen, Assia Mahboubi:
Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination. - Denis Cousineau:
On completeness of reducibility candidates as a semantics of strong normalization. - James Cheney:
A dependent nominal type theory. - Pablo Arrighi, Alejandro Díaz-Caro:
Scalar System F for Linear-Algebraic Lambda-Calculus: Towards a Quantum Physical Logic. - Thomas Braibant, Damien Pous:
Deciding Kleene Algebras in Coq. - Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi:
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions. - Andreas Abel, Gabriel Scherer:
On Irrelevance and Algorithmic Equality in Predicative Type Theory. - Freek Wiedijk:
A Synthesis of the Procedural and Declarative Styles of Interactive Theorem Proving. - Marc Bezem, Keiko Nakata, Tarmo Uustalu:
On streams that are finitely red.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.