Loïc Colson

According to our database1, Loïc Colson authored at least 17 papers between 1991 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Investigations on a Pedagogical Calculus of Constructions.
J. Univers. Comput. Sci., 2013

2009
Pedagogical second-order lambda-calculus.
Theor. Comput. Sci., 2009

2008
Pedagogical Second-order Propositional Calculi.
J. Log. Comput., 2008

Preface.
RAIRO Theor. Informatics Appl., 2008

2007
Another Paradox In Naive Set-Theory.
Stud Logica, 2007

Pedagogical Natural Deduction Systems: the Propositional Case.
J. Univers. Comput. Sci., 2007

2004
lambda-P Systems and Typed lambda-Calculus.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

2002
Syntactical Truth Predicates for Formulas with Atomic Negation.
Math. Struct. Comput. Sci., 2002

2001
Syntactical Truth Predicates For Second Order Arithmetic.
J. Symb. Log., 2001

Functions Versus Algorithms.
Proceedings of the Current Trends in Theoretical Computer Science, 2001

1999
On Diagonal Fixed Points of Increasing Functions.
Theor. Comput. Sci., 1999

1998
System T, Call-by-Value and the Minimum Problem.
Theor. Comput. Sci., 1998

The Logic in Computer Science Column Functions versus Algorithms.
Bull. EATCS, 1998

1996
A Unary Representation Result for System T.
Ann. Math. Artif. Intell., 1996

1994
On Strong Stability and Higher-Order Sequentiality
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1992
On List Primitive Recursion and the Complexity of Computing <i>inf</i>.
BIT, 1992

1991
About Primitive Recursive Algorithms.
Theor. Comput. Sci., 1991


  Loading...