Loïc Colson

2008
15	EE	Loïc Colson, David Michel: Pedagogical Second-order Propositional Calculi. J. Log. Comput. 18(4): 669-695 (2008)
2007
14	EE	Loïc Colson, David Michel: Pedagogical Natural Deduction Systems: the Propositional Case. J. UCS 13(10): 1396-1410 (2007)
13	EE	Loïc Colson: Another Paradox In Naive Set-Theory. Studia Logica 85(1): 33-39 (2007)
2004
12	EE	Loïc Colson, Natasa Jonoska, Maurice Margenstern: lambda-P Systems and Typed lambda-Calculus. Workshop on Membrane Computing 2004: 1-18
2002
11		Loïc Colson: Syntactical Truth Predicates for Formulas with Atomic Negation. Mathematical Structures in Computer Science 12(1): 1-18 (2002)
2001
10		Loïc Colson: Functions Versus Algorithms. Current Trends in Theoretical Computer Science 2001: 343-362
9		Loïc Colson, Serge Grigorieff: Syntactical Truth Predicates For Second Order Arithmetic. J. Symb. Log. 66(1): 225-256 (2001)
1999
8	EE	Loïc Colson: On Diagonal Fixed Points of Increasing Functions. Theor. Comput. Sci. 222(1-2): 181-186 (1999)
1998
7		Loïc Colson: The Logic in Computer Science Column Functions versus Algorithms. Bulletin of the EATCS 65: 98-117 (1998)
6	EE	Loïc Colson, Daniel Fredholm: System T, Call-by-Value and the Minimum Problem. Theor. Comput. Sci. 206(1-2): 301-315 (1998)
1996
5		Loïc Colson: A Unary Representation Result for System T. Ann. Math. Artif. Intell. 16: 385-403 (1996)
1994
4		Loïc Colson, Thomas Ehrhard: On Strong Stability and Higher-Order Sequentiality LICS 1994: 103-108
1992
3		Loïc Colson: On List Primitive Recursion and the Complexity of Computing inf. BIT 32(1): 5-9 (1992)
1991
2		Loïc Colson: About Primitive Recursive Algorithms. Theor. Comput. Sci. 83(1): 57-69 (1991)
1989
1		Loïc Colson: About Primitive Recursive Algorithms. ICALP 1989: 194-206

Coauthor Index

1	Thomas Ehrhard	[4]
2	Daniel Fredholm	[6]
3	Serge Grigorieff	[9]
4	Natasa Jonoska (Natasha Jonoska)	[12]
5	Maurice Margenstern	[12]
6	David Michel	[14] [15]

Colors in the list of coauthors