302 articles – 345 Notices  [english version]
.:. Consultation > Liste des articles .:.
647 documents classés par :
Première Page Page Précédente ... 38 - 39 - 40 - 41 - 42 - 43 - 44 Page Suivante Page Finale
Développement d'applications avec Objective Caml
Manoury P., Emmanuel C., Bruno P.
(2000) 400 [hal-00528476 - version 1]
Decidability of fourth-order matching
Padovani V.
Mathematical Structures in Computer Science 10, 3 (2000) 361-372 [hal-00527853 - version 1]
On Phase Semantics and Denotational Semantics in Multiplicative Additive Linear Logic
Ehrhard T., Bucciarelli A.
Annals of Pure and Applied Logic 102, 3 (2000) 247-282 [hal-00527039 - version 1]
Parallel and serial hypercoherences
Ehrhard T.
Theoretical Computer Science 247, 1-2 (2000) 39-81 [hal-00527036 - version 1]
fulltext access Building continuous webbed models for System F
Berardi S., Berline C.
Theoretical Computer Science 315 (2004) 3-34 [hal-00003750 - version 1]
Quantitative Semantics Revisited
Ehrhard T., Barreiro N.
In Typed Lambda Calculi and Applications, 4th International Conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proceedings - Typed Lambda Calculi and Applications, 4th International Conference, TLCA'99, Italy (1999) [hal-00527035 - version 1]
A Relative PCF-Definability Result for Strongly Stable Functions and some Corollaries
Ehrhard T.
Information and Computation 152, 1 (1999) 111-137 [hal-00527034 - version 1]
Timeless games
Ehrhard T., Danos V., Baillot P., Regnier L.
Dans Proceedings of the Conference for Computer Science Logic - Computer Science Logic, Danemark (1997) [hal-00519856 - version 1]
Believe it or not, AJM's games model is a model of classical linear logic
Ehrhard T., Danos V., Baillot P.
In Proceedings of the twelvth Symposium on Logic in Computer Science - Logic in Computer Science, Poland (1997) [hal-00519846 - version 1]
Decidability of All Minimal Models
Padovani V.
Dans Types for Proofs and Programs, International Workshop TYPES'95, Torino, Italy, June 5-8, 1995, Selected Papers - Types for Proofs and Programs, International Workshop TYPES'95, Italie (1995) [hal-00527844 - version 1]
Projecting Sequential Algorithms on Strongly Stable Functions
Ehrhard T.
Annals of Pure and Applied Logic 77, 3 (1996) 201-244 [hal-00527033 - version 1]
On Equivalence Classes of Interpolation Equations
Padovani V.
Dans Typed Lambda Calculi and Applications, Second International Conference on Typed Lambda Calculi and Applications, TLCA'95, Edinburgh, UK, April 10-12, 1995, Proceedings - Typed Lambda Calculi and Applications, Second International Conference on Typed Lambda Calculi and Applications, TLCA'95, Royaume-Uni (1995) [hal-00527849 - version 1]
Automatizing termination proofs of recursively defined functions
Manoury P., Marianne S.
Theoretical Computer Science, 135 (1994) pp 319-343 [hal-00528475 - version 1]
On Strong Stability and Higher-Order Sequentiality
Ehrhard T., Colson L.
In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, 4-7 July 1994, Paris, France - Ninth Annual IEEE Symposium on Logic in Computer Science, 4-7 July 1994, Paris, France, France (1994) [hal-00527032 - version 1]
Sequentiality in an Extensional Framework
Ehrhard T., Bucciarelli A.
Information and Computation 110, 2 (1994) 265-296 [hal-00527028 - version 1]