Full abstraction for pcf. Information and Computation, vol.163, pp.409-470, 2000. ,
Characterizing co-nl by a group action, Mathematical Structures in Computer Science, vol.26, issue.4, pp.606-638, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01005705
Logarithmic space and permutations, Information and Computation, vol.248, pp.2-21, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01005701
On the resolution semiring, 2014. ,
URL : https://hal.archives-ouvertes.fr/tel-01215334
Elementary complexity and geometry of interaction, Fundamenta Informaticae, vol.45, issue.1-2, pp.1-31, 2001. ,
URL : https://hal.archives-ouvertes.fr/hal-00084627
The undecidability of the domino problem. Number 66, 1966. ,
On the concept of a random sequence, Bulletin of the American Mathematical Society, vol.46, issue.2, pp.130-135, 1940. ,
Functionality in combinatory logic, Proceedings of the National Academy of Sciences of the United States of America, vol.20, p.584, 1934. ,
La Logique Linéaire appliquéeà l'étude de divers processus de normalisation (principalement du Lambda-calcul), vol.7, 1990. ,
The structure of multiplicatives, Archive for Mathematical logic, vol.28, issue.3, pp.181-203, 1989. ,
Correctness of linear logic proof structures is nl-complete, Theoretical Computer Science, vol.412, issue.20, pp.1941-1957, 2011. ,
Graph theoretical structures in logic programs and default theories, Theoretical Computer Science, vol.170, issue.1-2, pp.209-244, 1996. ,
Answer set programming: A primer, Reasoning Web International Summer School, pp.40-110, 2009. ,
Answer sets, Foundations of Artificial Intelligence, vol.3, pp.285-316, 2008. ,
Untersuchungenüber das logische schließen. i. Mathematische zeitschrift, vol.39, pp.176-210, 1935. ,
Untersuchungenüber das logische schließen, vol.39, pp.405-431, 1935. ,
Interprétation fonctionnelle etélimination des coupures de l'arithmétique d'ordre supérieur, 1972. ,
, Linear logic. Theoretical computer science, vol.50, issue.1, pp.1-101, 1987.
Geometry of interaction 2: Deadlock-free algorithms, International Conference on Computer Logic, pp.76-93, 1988. ,
Normal functors, power series and ?-calculus. Annals of pure and applied logic, vol.37, pp.129-177, 1988. ,
Geometry of interaction 1: Interpretation of system f, Studies in Logic and the Foundations of Mathematics, vol.127, pp.221-260, 1989. ,
Towards a geometry of interaction, Contemporary Mathematics, vol.92, issue.6, pp.69-108, 1989. ,
Geometry of interaction III: accommodating the additives, pp.329-389, 1995. ,
Locus solum: From the rules of logic to the logic of rules, Mathematical structures in computer science, vol.11, issue.3, p.301, 2001. ,
Geometry of interaction V: logic in the hyperfinite factor, Theoretical Computer Science, vol.412, issue.20, pp.1860-1883, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-01322171
Three lightings of logic, Computer Science Logic 2013 (CSL 2013). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2013. ,
Transcendental syntax II: Non-deterministic case, Logical Methods in Computer Science, 2016. ,
Transcendental syntax III: equality, Logical Methods in Computer Science, 2016. ,
Transcendental syntax I: deterministic case, Mathematical Structures in Computer Science, vol.27, issue.5, pp.827-849, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01322327
Recherches sur la théorie de la démonstration, 1930. ,
The formulae-as-types notion of construction, To HB Curry: essays on combinatory logic, lambda calculus and formalism, vol.44, pp.479-490, 1980. ,
On full abstraction for pcf: I, ii, and iii. Information and computation, vol.163, 2000. ,
Glueing and orthogonality for models of linear logic, Theoretical computer science, vol.294, issue.1-2, pp.183-231, 2003. ,
Relational queries computable in polynomial time, Information and Control, vol.68, issue.1, pp.80029-80037, 1986. ,
Descriptive complexity, Springer Science & Business Media, 2012. ,
Predicate logic as programming language, IFIP congress, vol.74, pp.569-544, 1974. ,
From proof nets to interaction nets, London Mathematical Society Lecture Note Series, pp.225-248, 1995. ,
Unification revisited, Foundations of logic and functional programming, pp.67-113, 1988. ,
Semantics of horn and disjunctive logic programs, Theoretical Computer Science, vol.86, issue.1, pp.93-106, 1991. ,
An efficient unification algorithm, ACM Transactions on Programming Languages and Systems (TOPLAS), vol.4, issue.2, pp.258-282, 1982. ,
Dominator trees and fast verification of proof nets, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No. 99CB36332), pp.181-191, 2000. ,
On the computational meaning of axioms, Epistemology, Knowledge and the Impact of Interaction, pp.141-184, 2016. ,
URL : https://hal.archives-ouvertes.fr/halshs-01313400
Coherent interaction graphs, 2019. ,
Termination analysis of logic programs based on dependency graphs, International Symposium on Logic-based Program Synthesis and Transformation, pp.8-22, 2007. ,
An introduction to tile-based self-assembly and a survey of recent results, Natural Computing, vol.13, issue.2, pp.195-224, 2014. ,
Lambda-calcul et réseaux, 1992. ,
Strong normalization as safe interaction, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.13-22, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00130456
A machine-oriented logic based on the resolution principle, Journal of the ACM, vol.12, issue.1, pp.23-41, 1965. ,
Nucleic acid junctions and lattices, Journal of theoretical biology, vol.99, issue.2, pp.237-247, 1982. ,
Interaction graphs: multiplicatives, Annals of Pure and Applied Logic, vol.163, issue.12, pp.1808-1837, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-01159218
Logique dans le facteur hyperfini: géometrie de l'interaction et complexité, 2012. ,
Interaction graphs: additives, Annals of Pure and Applied Logic, vol.167, issue.2, pp.95-154, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01922470
Interaction graphs: Full linear logic, 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp.1-10, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01312688
Interaction graphs: Graphings, Annals of Pure and Applied Logic, vol.168, issue.2, pp.278-320, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01922459
Interaction graphs: Non-deterministic automata, ACM Transactions on Computational Logic (TOCL), vol.19, issue.3, pp.1-24, 2018. ,
, Thomas Seiller. Interaction graphs: Exponentials. Logical Methods in Computer Science, vol.15, 2019.
, Probabilistic complexity classes through semantics, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02458358
On computable numbers, with an application to the entscheidungsproblem, J. of Math, vol.58, issue.5, pp.345-363, 1936. ,
The complexity of relational query languages, Proceedings of the fourteenth annual ACM symposium on Theory of computing, pp.137-146, 1982. ,
Proving theorems by pattern recognition -II. Bell system technical journal, vol.40, pp.1-41, 1961. ,
Algorithmic self-assembly of DNA, 1998. ,
Diverse and robust molecular algorithms using reprogrammable dna self-assembly, Nature, vol.567, issue.7748, pp.366-372, 2019. ,