Disjunctive normal forms and local exceptions, 2003. ,
DOI : 10.1145/944705.944724
URL : https://hal.archives-ouvertes.fr/hal-00009191
Disjunctive Tautologies as Synchronisation Schemes, Proceedings of CSL'00, number 1862 in Lecture Notes in Computer Science, pp.292-301, 2000. ,
DOI : 10.1007/3-540-44622-2_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.2792
A formulae-as-type notion of control, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.47-58, 1990. ,
DOI : 10.1145/96709.96714
Typed lambda-calculus in classical Zermelo-Fr??nkel set theory, Archive for Mathematical Logic, vol.40, issue.3, pp.189-205, 2001. ,
DOI : 10.1007/s001530000057
Dependent choice, ???quote??? and the clock, Theoretical Computer Science, vol.308, issue.1-3 ,
DOI : 10.1016/S0304-3975(02)00776-4
URL : https://hal.archives-ouvertes.fr/hal-00154478
????-Calculus: An algorithmic interpretation of classical natural deduction, Proceedings of Conference on Logic Programming and Automated Reasoning, pp.190-201, 1992. ,
DOI : 10.1007/BFb0013061