Abstract

1 Interprétation calculatoire de la logique soustractive..................... 7 1.1 Présentation du premier article..................................... 7 1.2 À propos des systèmes avec relations de dépendance...................... 13 1.3 Logique à domaine constant et arithmétique............................ 14

Citations

1219	An axiomatic basis for computer programming - Hoare - 1969
1182	A structural approach to operational semantics - Plotkin - 1981
651	Notions of computation and monads - Moggi - 1991
504	Assigning meanings to programs - FLOYD - 1967
395	The formulae-as-types notion of construction - Howard - 1980
299	The mechanical evaluation of expressions - Landin - 1964
235	The essence of compiling with continuations - Flanagan, Sabry, et al. - 1993
213	Monad transformers and modular interpreters - Liang, Hudak, et al. - 1995
206	A formulae-as-types notion of control - Griffin - 1990
194	The revised 5 report on the algorithmic language Scheme - Kelsey, Clinger, et al. - 1998
192	Standard ML of New Jersey - McQueen, Appel - 1991
184	Combinatory Logic - Curry, Feys - 1958
154	An abstract view of programming languages - Moggi - 1990
148	Call-by-name, call-by-value and the lambda-calculus - Plotkin
135	The type and effect discipline - Talpin, Jouvelot - 1992
117	A correspondence between ALGOL 60 and Church's lambda notation - Landin - 1965
116	Representing monads - Filinski - 1994
112	eine bisher noch nicht benutzte Erweiterung des finiten Standpunktes, Dialectica, Vol: 12 - Godel, Uber - 1958
88	Typing first-class continuations in ML - Harper, Duba, et al. - 1993
79	A generic account of continuation-passing styles - Hatcli, Danvy - 1994
77	Procedures and parameters: An axiomatic approach - Hoare - 1971
72	Integrating functional and imperative programming - Gifford, Lucassen - 1986
67	Methods and logics for proving programs - Cousot - 1990
65	Ten years of Hoare's logic, a survey, part I - Apt - 1981
61	Extracting Constructive Content from Classical Proofs - Murthy - 1990
61	Polymorphism and separation in Hoare type theory - NANEVSKI, MORRISETT, et al. - 2006
59	Strong normalization for second order classical natural deduction - Parigot
58	A functional abstraction of typed contexts - Danvy, Filinski - 1989
51	Computational types from a logical perspective - Benton, Bierman, et al. - 1998
51	Recursive programming with proofs - PARIGOT - 1992
48	Representing layered monads - Filinski - 1999
44	Classical proofs as programs - Parigot - 1993
41	An evaluation semantics for classical proofs - Murthy - 1991
40	Classical Logic, Storage Operators and Second Order LambdaCalculs - KRIVINE - 1994
40	Recursive Functions - Péter - 1977
39	Imperative Programming with Dependent Types - Xi - 2000
34	An observationally complete program logic for imperative higher-order functions - Honda, Yoshida, et al. - 2005
31	Contracting proofs to programs - Leivant - 1990
30	A Generalization of Jumps and Labels - Landin - 1965
30	Monads and composable continuations - Wadler - 1994
29	Programming language constructs for which it is impossible to obtain good Hoare axiom systems - Clarke - 1979
28	Extracting Constructive Content from Classical Logic via Control-Like Reductions - Barbanera, Berardi - 1993
27	Parameterized notions of computation - Atkey - 2009
27	A compositional logic for control flow - Tan, Appel - 2006
26	Program proving: Jumps and functions - CLINT, HOARE - 1971
26	A simple calculus of exception handling - DeGroote - 1995
21	The Definition of Standard ML, Revised Edition - Milner, Tofte, et al. - 1997
20	Modular verification of assembly code with stack-based control abstractions - Feng, Shao, et al.
12	Descriptive and relative completeness of logics for higher-order functions - Honda, Berger, et al. - 2006
12	Intuitionistische Untersuchungen der formalistischen Logik - Kuroda - 1951