Patrick Baillot
2015
On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy
Information and Computation
241
3–31
10.1016/j.ic.2014.10.005
Patrick Baillot
Erika De Benedetti
Simona Ronchi Della Rocca
2018
Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
Information and Computation
261
55–77
10.1016/j.ic.2018.05.005
Patrick Baillot
Alexis Ghyselen
2018
Combining Linear Logic and Size Types for Implicit Complexity
27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
9:1–9:21
10.4230/LIPIcs.CSL.2018.9
Alberto Carraro
Giulio Guerrieri
2014
A Semantical and Operational Account of Call-by-Value Solvability
Foundations of Software Science and Computation Structures (FoSSaCS'14)
103–118
10.1007/978-3-642-54830-7_7
Ugo Dal Lago
Patrick Baillot
2006
On light logics, uniform encodings and polynomial time
Mathematical Structures in Computer Science
16
4
713–733
10.1017/S0960129506005421
Vincent Danos
Jean-Baptiste Joinet
2003
Linear logic and elementary time
Information and Computation
183
1
123–137
10.1016/S0890-5401(03)00010-5
Simona Ronchi Della Rocca
Ugo Dal Lago
Paolo Coppola
2008
Light Logics and the Call-by-Value Lambda Calculus
Logical Methods in Computer Science
Volume 4, Issue 4
10.2168/LMCS-4(4:5)2008
Emmanuel Filiot
Pierre-Alain Reynier
2016
Transducers, Logic and Algebra for Functions of Finite Words
ACM SIGLOG News
3
3
4–19
10.1145/2984450.2984453
Jean-Yves Girard
1998
Light Linear Logic
Information and Computation
143
2
175–204
10.1006/inco.1998.2700
Charles Grellois
2016
Semantics of linear logic and higher-order model-checking
Université Denis Diderot Paris 7
https://tel.archives-ouvertes.fr/tel-01311150/
Charles Grellois
Paul-André Melliès
2015
Finitary Semantics of Linear Logic and Higher-Order Model-Checking
Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015
256–268
10.1007/978-3-662-48057-1_20
Giulio Guerrieri
Giulio Manzonetto
2019
The Bang Calculus and the Two Girard's Translations
Electronic Proceedings in Theoretical Computer Science
292
15–30
10.4204/EPTCS.292.2
Gerd G. Hillebrand
1994
Finite Model Theory in the Simply Typed Lambda Calculus
Brown University
Providence, RI, USA
Gerd G. Hillebrand
Paris C. Kanellakis
1996
On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi
Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
IEEE Computer Society
253–263
10.1109/LICS.1996.561337
Lê Thành D~ung Nguy~ên
2019
Around finite second-order coherence spaces
CoRR
abs/1902.00196
Lê Thành D~ung Nguy~ên
Pierre Pradic
2019
From normal functors to logarithmic space queries
46th International Colloquium on Automata, Languages and Programming (ICALP'19)
123:1–123:15
10.4230/LIPIcs.ICALP.2019.123
Laurent Regnier
1994
Une équivalence sur les lambda-termes
Theoretical Computer Science
126
2
281–292
10.1016/0304-3975(94)90012-4
Alex Simpson
2005
Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics
16th International Conference on Term Rewriting and Applications (RTA'05)
219–234
10.1007/978-3-540-32033-3_17
Kazushige Terui
2012
Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus
23rd International Conference on Rewriting Techniques and Applications (RTA'12)
323–338
10.4230/LIPIcs.RTA.2012.323