8 résultats  enregistrer la recherche


hal-00798298v1  Communication dans un congrès
Patrick BaillotUgo Dal LagoHigher-Order Interpretations and Program Complexity
Patrick Cegielski and Arnaud Durand. 21st Annual Conference of the EACSL, Computer Science Logic 2012 (CSL), Sep 2012, Fontainebleau, France. Schloss Dagstuhl, 16, pp.62-76, 2012, LIPIcs. <10.4230/LIPIcs.CSL.2012.62>
hal-01284117v1  Communication dans un congrès
Patrick BaillotGilles BartheUgo Dal LagoImplicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-20), Nov 2015, Suva, Fiji
hal-00798315v1  Article dans une revue
Patrick BaillotPaolo CoppolaUgo Dal LagoLight logics and optimal reduction: Completeness and complexity
Information and Computation, Elsevier, 2011, 209 (2), pp.118-142. <10.1016/j.ic.2010.10.002>
...
hal-00443944v1  Communication dans un congrès
Patrick BaillotMarco GaboardiVirgile MogbilA PolyTime Functional Language from Light Linear Logic
Andrew D. Gordon. 19th European Symposium on Programming (ESOP 2010), Mar 2010, Paphos, Cyprus. Springer Berlin / Heidelberg, 6012 (6012), pp. 104-124, 2010, Lecture Notes in Computer Science. <10.1007/978-3-642-11957-6>
hal-00798377v1  Article dans une revue
Patrick BaillotUgo Dal LagoJean-Yves MoyenOn quasi-interpretations, blind abstractions and implicit complexity.
Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2012, 22 (04), pp.549-580. <10.1017/S0960129511000685>