Tristan Crolard

	2009
8		Tristan Crolard, Emmanuel Polonowski, Pierre Valarcher: Extending the loop language with higher-order procedural variables. ACM Trans. Comput. Log. 10(4): (2009)
7		Tristan Crolard, Emmanuel Polonowski: A Formally Specified Type System and Operational Semantics for Higher-Order Procedural Variables CoRR abs/0910.1020: (2009)
	2006
6		Tristan Crolard, Samuel Lacas, Pierre Valarcher: On the Expressive Power of the Loop Language. Nord. J. Comput. 13(1-2): 46-57 (2006)
	2004
5		Danièle Beauquier, Tristan Crolard, Evguenia Prokofieva: Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic. TACAS 2004: 372-387
4		Tristan Crolard: A Formulae-as-Types Interpretation of Subtractive Logic. J. Log. Comput. 14(4): 529-570 (2004)
	2001
3		Tristan Crolard: Subtractive logic. Theor. Comput. Sci. 254(1-2): 151-185 (2001)
	1999
2		Tristan Crolard: A type theory which is complete for Kreisel's modified realizability. Electr. Notes Theor. Comput. Sci. 23(1): (1999)
1		Tristan Crolard: A confluent lambda-calculus with a catch/throw mechanism. J. Funct. Program. 9(6): 625-647 (1999)

Coauthor Index

1	Danièle Beauquier	[5]
2	Samuel Lacas	[6]
3	Emmanuel Polonowski	[7] [8]
4	Evguenia Prokofieva	[5]
5	Pierre Valarcher	[6] [8]

Colors in the list of coauthors