.:. Browse > List by subject > Computer Science .:.

83 documents ordered by : Date Title first author name document type Submit date

1 - 2 - 3 - 4 - 5 - 6 - 7 ...

Extracting Herbrand trees in classical realizability using forcing Rieg L. (15/04/2013) [ensl-00814278 - version 1]

Extracting Herbrand trees from Coq Rieg L. [ensl-00814115 - version 1]

On the strength of weak compactness Kreuzer A. P. Computability 1, 2 (2012) 171-179 [hal-00795017 - version 1]

Intersection Types with Subtyping by Means of Cut Elimination Laurent O. Fundamenta Informaticae 121, 1-4 (2012) 203-226 [hal-00768868 - version 1]

Parametricity in an Impredicative Sort Keller C., Lasson M. Dans CSL - 26th International Workshop/21st Annual Conference of the EACSL - 2012 16 (2012) 381-395 [hal-00730913 - version 1]

Higher-Order Interpretations and Program Complexity Baillot P., Dal Lago U. Dans 21st Annual Conference of the EACSL, Computer Science Logic 2012 (CSL) 16 (2012) 62-76 [hal-00798298 - version 1]

A Presheaf Environment for the Explicit Fusion Calculus Bonchi F., Maria Grazia B., Vincenzo C., Gadducci F. Journal of Automated Reasoning 49, 2 (2012) 161-183 [hal-00777522 - version 1]

The Refined Calculus of Inductive Construction: Parametricity and Abstraction Keller C., Lasson M. Dans LICS - 27th Annual IEEE Symposium on Logic in Computer Science - 2012 (2012) [hal-00757620 - version 1]

On the Rationality of Escalation Lescanne P., Matthieu P. none (2012) 23 [ensl-00439911 - version 2]

On quasi-interpretations, blind abstractions and implicit complexity. Baillot P., Dal Lago U., Moyen J.-Y. Mathematical Structures in Computer Science 22, 04 (2012) 549-580 [hal-00798377 - version 1]