Biblio EHRHARD Thomas

1998	Ehrhard Thomas, Lafont Yves and Régnier Laurent. Logic and models of computation. Papers from the conference held in Marseille, September 1996. Edited by Thomas Ehrhard, Yves Lafont and Laurent Regnier. Math. Structures Comput. Sci. 8, no. 6. Cambridge University Press, New York, pp. 541--710, 1998.
	Baillot Patrick, Danos Vincent, Ehrhard Thomas and Régnier Laurent. Timeless games. Computer science logic (Aarhus, 1997), 56--77, Lecture Notes in Comput. Sci., 1414, Springer, Berlin, 1998.	[BDER97b]
1997	Baillot Patrick, Danos Vincent, Ehrhard Thomas and Régnier Laurent. Believe it or not, AJM's games model is a model of classical linear logic. Proceedings of the twelfth Symposium on Logic in Computer Science, Varsovie, 1997.	[BDER97a]
1996	Ehrhard Thomas. Projecting sequential algorithms on strongly stable functions. Ann. Pure Appl. Logic 77, no. 3, 201--244, 1996.	[Ehr96a]
1995	Ehrhard Thomas. Hypercoherences: a strongly stable model of linear logic. Math. Structures Comput. Sci. 3 (1993), no. 4, 365--385. Also in Advances in linear logic (Ithaca, NY, 1993), 83--108, London Math. Soc. Lecture Note Ser., 222, Cambridge Univ. Press, Cambridge, 1995.	[Ehr95]
1994	Bucciarelli Antonio and Ehrhard Thomas. Sequentiality in an extensional framework. 1991 IEEE Symposium on Logic in Computer Science (Amsterdam, 1991). Inform. and Comput. 110, no. 2, 265--296, 1994.
1993	Bucciarelli Antonio and Ehrhard Thomas. A theory of sequentiality. Theoret. Comput. Sci. 113, no. 2, 273--291, 1993.
1991	Bucciarelli Antonio and Ehrhard Thomas. Extensional embedding of a strongly stable model of PCF. Automata, languages and programming (Madrid, 1991), 35--46, Lecture Notes in Comput. Sci., 510, Springer, Berlin, 1991.
	Ehrhard Thomas and Malacaria Pasquale. Stone duality for stable functions. Category theory and computer science (Paris, 1991), 1--15, Lecture Notes in Comput. Sci., 530, Springer, Berlin, 1991.
1989	Ehrhard Thomas. Dictoses. Category theory and computer science (Manchester, 1989), 213--223, Lecture Notes in Comput. Sci., 389, Springer, Berlin-New York, 1989.
1987	Coquand Thierry and Ehrhard Thomas. An equational presentation of higher order logic. Category theory and computer science (Edinburgh, 1987), 40--56, Lecture Notes in Comput. Sci., 283, Springer, Berlin-New York, 1987.

Année	Publications	Files & Ref.IML
	Ehrhard Thomas, Regnier Laurent. Uniformity and the Taylor expansion of ordinary lambda-terms. Theoretical Computer Science, Elsevier, 2005. A paraître.
	Ehrhard Thomas, Regnier Laurent. Differential interaction nets. Theoretical Computer Science, 2005. À paraître.
2006	Ehrhard Thomas, Laurent Olivier. Embedding the finitary pi-calculus in differential interaction nets. Proceedings du workshop Higher Order Rewriting 2006. Publication électronique (accessible depuis ma page web, http://iml.univ-mrs.fr/~ehrhard/ ), 2006.
	Ehrhard Thomas, Regnier Laurent. Böhm trees, Krivine machine and the Taylor expansion of ordinary lambda-terms. Proceedings de Logical approaches to computational barriers (CIE 2006), Lecture Notes in Computer Science 3988: 186-197, Springer Verlag, 2006.
2005	Ehrhard Thomas, Regnier Laurent. Differential interaction nets. Proceedings of the 11th Workshop on Logic, Language, Information and Computation (WoLLIC 2004), 35--74 (electronic), Electron. Notes Theor. Comput. Sci., 123, Elsevier, Amsterdam, 2005.
	Ehrhard Thomas, Finiteness spaces. Math. Structures Comput. Sci. 15, no. 4, 615--646, 2005.
2004	Ehrhard Thomas. A completeness theorem for symmetric product phase spaces. J. Symbolic Logic 69, no. 2, 340--370, 2004.
	Ehrhard Thomas, Girard Jean-Yves, Ruet Paul, Scott Philip. Linear logic in computer science. London Mathematical Society Lecture Note Series 316, Cambridge University Press, 2004.
2003	Ehrhard Thomas, Regnier Laurent. The differential lambda-calculus. Theoret. Comput. Sci. 309, no. 1-3, 1--41, 2003.
2002	Ehrhard Thomas. On Köthe sequence spaces and linear logic. Math. Structures Comput. Sci. 12, no. 5, 579--623, 2002.
2001	Bucciarelli Antonio, Ehrhard Thomas. On phase semantics and denotational semantics: the exponentials. Ann. Pure Appl. Logic 109, no. 3, 205--241, 2001.
2000	Ehrhard Thomas. Parallel and serial hypercoherences. Theoret. Comput. Sci. 247, no. 1-2, 39--81, 2000.	[Ehr99]
	Bucciarelli Antonio, Ehrhard Thomas. On phase semantics and denotational semantics in multiplicative-additive linear logic. Annals of Pure and Applied Logic 102, no. 3, 247--282, 2000. abstract	118 k [Be99b]
1999	Ehrhard Thomas. A relative PCF-definability result for strongly stable functions and some corollaries. Information and Computation 152, no.1, pp.111-137, Academic Press, 1999. abstract	[Ehr96a]
	Barreiro Nuno, Ehrhard Thomas. Quantitative semantics revisited (extended abstract). Typed lambda calculi and applications (L'Aquila, 1999), 40--53, Lecture Notes in Comput. Sci., 1581, Springer, Berlin, 1999.	[BE99a]