Proofs and types
Machine models and simulations
Handbook of theoretical computer science (vol. A)
A logical calculus for polynomial-time realizability
Methods of Logic in Computer Science
Information and Computation
Dependent types in practical programming
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
Polymorphism is Set Theoretic, Constructively
Category Theory and Computer Science
COLOG '88 Proceedings of the International Conference on Computer Logic
Linear types and non-size-increasing polynomial time computation
Information and Computation - Special issue: ICC '99
Realizability models for BLL-like languages
Theoretical Computer Science - Implicit computational complexity
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
The weak lambda calculus as a reasonable machine
Theoretical Computer Science
Typing lambda terms in elementary logic with linear constraints
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A Semantic Proof of Polytime Soundness of Light Affine Logic
Theory of Computing Systems - Special Issue: Symposium on Computer Science; Guest Editors: Sergei Artemov, Volker Diekert and Alexander Razborov
Quantitative models and implicit complexity
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Higher-order functional reactive programming in bounded space
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 5.23 |
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs are obtained by instantiating a semantic framework previously introduced by the authors and based on an innovative modification of realizability. The proof is a notable simplification on the original already semantic proof of soundness for the above mentioned logical systems and programming languages. A new result made possible by the semantic framework is the addition of polymorphism and a modality to LFPL, thus allowing for an internal definition of inductive datatypes. The methodology presented proceeds by assigning both abstract resource bounds in the form of elements from a resource monoid and resource-bounded computations to proofs (respectively, programs).