Ten Years of Hoare's Logic: A Survey---Part I, ACM Transactions on Programming Languages and Systems, vol.3, issue.4, pp.431-483, 1981. ,
DOI : 10.1145/357146.357150
Deriving Proof Rules from Continuation Semantics, Formal Aspects of Computing, vol.11, issue.4, pp.426-447, 1999. ,
DOI : 10.1007/s001650050041
Extracting constructive content from classical logic via control-like reductions, LNCS, vol.662, pp.47-59, 1994. ,
DOI : 10.1007/BFb0037097
High integrity software: the SPARK approach to safety and security, 2003. ,
Computational types from a logical perspective, Journal of Functional Programming, vol.8, issue.2, pp.177-193, 1998. ,
DOI : 10.1017/S0956796898002998
Program Logics for Sequential Higher-Order Control, Proceedings of the Third IPM International Conference, pp.194-211, 2009. ,
DOI : 10.1007/978-3-642-11623-0_11
Refined program extraction from classical proofs, Annals of Pure and Applied Logic, vol.114, issue.1-3, pp.3-25, 2002. ,
DOI : 10.1016/S0168-0072(01)00073-2
Program Development by Proof Transformation, Proof and Computation NATO Advanced Study Institute, International Summer School held in Marktoberdorf, pp.1-45, 1993. ,
DOI : 10.1007/978-3-642-79361-5_1
Program extraction from classical proofs, Logic and Computational Complexity, pp.77-97, 1995. ,
DOI : 10.1007/3-540-60178-3_80
On the frame problem in procedure specifications. Software Engineering, IEEE Transactions on, vol.21, issue.10, pp.785-798, 2002. ,
Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems, Journal of the ACM, vol.26, issue.1, 1979. ,
DOI : 10.1145/322108.322121
Program proving: Coroutines, Acta Informatica, vol.6, issue.1, pp.50-63, 1973. ,
DOI : 10.1007/BF00571463
Program proving: Jumps and functions, Acta Informatica, vol.8, issue.Nos. 2 and 3, pp.214-224, 1972. ,
DOI : 10.1007/BF00288686
System T, call-by-value and the minimum problem, Theoretical Computer Science, vol.206, issue.1-2, pp.301-315, 1998. ,
DOI : 10.1016/S0304-3975(98)00011-5
Implementing mathematics with the Nuprl proof development system, 1986. ,
Computational Content of Classical Logic, Semantics and Logics of Computation, pp.470-517, 1996. ,
Methods and Logics for Proving Programs, Handbook of Theoretical Computer Science, pp.841-994, 1990. ,
DOI : 10.1016/B978-0-444-88074-1.50020-2
A Formulae-as-Types Interpretation of Subtractive Logic, Journal of Logic and Computation, vol.14, issue.4, pp.529-570, 2004. ,
DOI : 10.1093/logcom/14.4.529
URL : https://hal.archives-ouvertes.fr/hal-00094584
Certification de programmes impératifs d'ordre supérieur avec mécanismes de contrôle, 2010. ,
A Formally Specified Program Logic for Higher-Order Procedural Variables and non-local Jumps, 2011. ,
A program logic for higher-order procedural variables and non-local jumps, pp.1112-1554, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00651407
Extending the loop language with higher-order procedural variables, ACM Transactions on Computational Logic, vol.10, issue.4, pp.1-37, 2009. ,
DOI : 10.1145/1555746.1555750
URL : https://hal.archives-ouvertes.fr/hal-00422158
Combinatory Logic, 1958. ,
A sound and relatively complete Hoare-logic for a language with higher type procedures, Acta Informatica, vol.20, issue.1, pp.59-101, 1983. ,
DOI : 10.1007/BF00264295
Back to direct style, ESOP'92, pp.130-150, 1992. ,
Back to direct style II: first-class continuations. SIGPLAN Lisp Pointers, pp.299-310, 1992. ,
A simple calculus of exception handling, Second International Conference on Typed Lambda Calculi and Applications, pp.201-215, 1995. ,
DOI : 10.1007/BFb0014054
Locations considered unnecessary, Acta Informatica, vol.8, issue.3, pp.221-242, 1977. ,
DOI : 10.1007/BF00264468
The calculi of lambda-nu-cs conversion: a syntactic theory of control and state in imperative higher-order programming languages, 1987. ,
Modular Verification of Assembly Code with Stack-Based Control Abstractions, Proc. 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'06), pp.401-414, 2006. ,
Assigning meanings to programs, Mathematical Aspects of Computer Science, vol.19, pp.19-321, 1967. ,
DOI : 10.1090/psapm/019/0235771
Classically and intuitionistically provably recursive functions. Higher Set Theory, pp.21-27, 1978. ,
Specification and verification I. Lecture notes, 1988. ,
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
Abstract, Journal of Functional Programming, vol.306, issue.04, pp.465-484, 1993. ,
DOI : 10.1145/363744.363749
A generic account of continuation-passing styles, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '94, pp.458-471, 1994. ,
DOI : 10.1145/174675.178053
Information Loss in the Programming Logic TK, Programming Concepts and Methods, pp.509-545, 1990. ,
On the Degeneracy of ??-Types in Presence of Computational Classical Logic, Seventh International Conference, TLCA '05 Proceedings, pp.209-220, 2005. ,
DOI : 10.1007/11417170_16
An axiomatic basis for computer programming, Communications of the ACM, vol.12, issue.10, pp.576-580, 1969. ,
DOI : 10.1145/363235.363259
Procedures and parameters: An axiomatic approach, Symposium on Semantics of Algorithmic Languages, pp.102-116, 1971. ,
DOI : 10.1007/BFb0059696
Descriptive and Relative Completeness of Logics for Higher-Order Functions, Automata, Languages and Programming, pp.360-371, 2006. ,
DOI : 10.1007/11787006_31
An observationally complete program logic for imperative higher-order functions, Theoretical Computer Science, vol.517, pp.270-279, 2005. ,
DOI : 10.1016/j.tcs.2013.11.003
The Formulae-as-types Notion of Constructions, To H.B. Curry: Essays on Combinatory Logic, Lambda- Calculs and Formalism, pp.479-490, 1969. ,
Connection between Dijkstra's Predicate-Transformers and Denotational Continuation-Semantics, DAIMI Report Series, vol.7, issue.86, 1978. ,
DOI : 10.7146/dpb.v7i86.6502
Systematic software development using VDM, 1990. ,
Revised 5 Report on the Algorithmic Language Scheme. Higher-Order and Symbolic Computation, Also appears in ACM SIGPLAN Notices, vol.11, issue.339, pp.7-105, 1998. ,
Hoare Logic and Auxiliary Variables, Formal Aspects of Computing, vol.11, issue.5, pp.541-566, 1999. ,
DOI : 10.1007/s001650050057
Classical logic, storage operators and second-order lambda-calculus, Annals of Pure and Applied Logic, vol.68, issue.1, pp.53-78, 1994. ,
DOI : 10.1016/0168-0072(94)90047-7
Programming with proofs, J. Inf. Process. Cybern. EIK, vol.26, issue.3, pp.149-167, 1990. ,
The Mechanical Evaluation of Expressions, The Computer Journal, vol.6, issue.4, pp.308-320, 1964. ,
DOI : 10.1093/comjnl/6.4.308
A correspondence between ALGOL 60 and Church's Lambda-notations: Part II, Communications of the ACM, vol.8, issue.3, pp.158-167, 1965. ,
DOI : 10.1145/363791.363804
A Generalization of Jumps and Labels, UNIVAC Systems Programming Research, 1965. ,
Correspondence between ALGOL 60 and Church's Lambda-notation: part I, Communications of the ACM, vol.8, issue.2, pp.89-101, 1965. ,
DOI : 10.1145/363744.363749
Contracting proofs to programs, Logic and Computer Science, pp.279-327, 1990. ,
Intrinsic reasoning about functional programs I: first order theories, Annals of Pure and Applied Logic, vol.114, issue.1-3, pp.117-153, 2002. ,
DOI : 10.1016/S0168-0072(01)00078-1
Towards constructive program derivation in VDM, Foundations of Software Technology and Theoretical Computer Science, pp.115-132, 1990. ,
DOI : 10.1007/3-540-53487-3_39
Practical Program Extraction from Classical Proofs Electronic Notes in Theoretical Computer Science, Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXI), pp.521-542, 2006. ,
Simplifying Programs Extracted from Classical Proofs, Workshop on Classical logic and Computation, 2006. ,
The complexity of loop programs, Proceedings of the 1967 22nd national conference on -, 1976. ,
DOI : 10.1145/800196.806014
An abstract view of programming languages, 1990. ,
Notions of Computation and Monads. Information and Computation, pp.55-92, 1991. ,
Extracting Constructive Content from Classical proofs, 1990. ,
An evaluation semantics for classical proofs, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.96-107, 1991. ,
DOI : 10.1109/LICS.1991.151634
Classical proofs as programs: How, what and why, 1991. ,
DOI : 10.1007/BFb0021084
Polymorphism and separation in hoare type theory, Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming, pp.62-73, 2006. ,
Ynot: Reasoning with the awkward squad, ACM SIGPLAN International Conference on Functional Programming. Citeseer, 2008. ,
From Algol to polymorphic linear lambda-calculus, Journal of the ACM, vol.47, issue.1, pp.167-223, 2000. ,
DOI : 10.1145/331605.331611
Strong normalization for second order classical natural deduction, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science, 1993. ,
DOI : 10.1109/LICS.1993.287602
A judgmental reconstruction of modal logic, Mathematical Structures in Computer Science, vol.11, issue.04, pp.511-540, 2001. ,
DOI : 10.1017/S0960129501003322
System Description: Twelf ??? A Meta-Logical Framework for Deductive Systems, CADE- 16: Proceedings of the 16th International Conference on Automated Deduction, pp.202-206, 1999. ,
DOI : 10.1007/3-540-48660-7_14
Call-by-name, call-by-value and the ??-calculus, Theoretical Computer Science, vol.1, issue.2, pp.125-159, 1975. ,
DOI : 10.1016/0304-3975(75)90017-1
Proofs-as-Imperative-Programs: Application to Synthesis of Contracts, Perspectives of System Informatics: 5th International Andrei Ershov Memorial Conference, PSI 2003, 2003. ,
DOI : 10.1007/978-3-540-39866-0_13
THE CURRY-HOWARD ISOMORPHISM ADAPTED FOR IMPERATIVE PROGRAM SYNTHESIS AND REASONING, Proceedings of the 7th and 8th Asian Logic Conferences, 2003. ,
DOI : 10.1142/9789812705815_0015
The ? ? -calculus, Theoretical Aspects of Computer Software, pp.516-542, 1994. ,
About Hoare Logics for Higher-Order Store, Automata, Languages and Programming, pp.1337-1348, 2005. ,
DOI : 10.1007/11523468_108
On the relation between direct and continuation semantics. Automata, languages and programming, pp.141-156, 1974. ,
Denotational semantics: a methodology for language development, 1986. ,
Reasoning with continuations II: full abstraction for models of control, Proceedings of the 1990 ACM conference on LISP and functional programming , LFP '90, pp.161-175, 1990. ,
DOI : 10.1145/91556.91626
Lectures on the Curry-Howard Isomorphism, of Studies in Logic and the Foundations of Mathematics, 2006. ,
The Z notation: a reference manual, 1989. ,
A Hoare Logic for the State Monad, Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics, pp.440-451, 2009. ,
DOI : 10.1007/978-3-540-74591-4_23
A Compositional Logic for Control Flow, Verification, Model Checking, and Abstract Interpretation, pp.80-94, 2006. ,
DOI : 10.1007/11609773_6
Continuations in possible-world semantics, Theoretical Computer Science, vol.85, issue.2, pp.283-303, 1991. ,
DOI : 10.1016/0304-3975(91)90184-4
An Introduction to Landin's " A Generalization of Jumps and Labels, Higher-Order and Symbolic Computation, pp.117-123, 1998. ,
Control effects as a modality, Journal of Functional Programming, vol.19, issue.01, pp.17-26, 2008. ,
DOI : 10.1145/289423.289429
In Handbook of proof theory, pp.407-473, 1998. ,
Imperative Programming with Dependent Types, Proceedings of 15th IEEE Symposium on Logic in Computer Science, pp.375-387, 2000. ,