Introduction to higher order categorical logic
Introduction to higher order categorical logic
Theoretical Computer Science
BCK-combinators and linear &lgr;-terms have types
Theoretical Computer Science
Proofs and types
Bounded linear logic: a modular approach to polynomial-time computability
Theoretical Computer Science
Computational interpretations of linear logic
Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
Handbook of logic in computer science (vol. 1)
Information and Computation
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
Inductive Definitions in the system Coq - Rules and Properties
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Linear Types and Non Size-Increasing Polynomial Time Computation
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
Closed reduction: explicit substitutions without $\alpha$-conversion
Mathematical Structures in Computer Science
The Geometry of Linear Higher-Order Recursion
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Semantically linear programming languages
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Theoretical Computer Science
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Linearity and PCF: a semantic insight!
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Linearity and iterator types for Gödel's System
Higher-Order and Symbolic Computation
Least and Greatest Fixed Points in Linear Logic
ACM Transactions on Computational Logic (TOCL)
Rewriting Computation and Proof
| Hi-index | 0.01 |
The linear lambda calculus is very weak in terms of expressive power: in particular, all functions terminate in linear time. In this paper we consider a simple extension with Booleans, natural numbers and a linear iterator. We show properties of this linear version of Gödel’s System $\mathcal{T}$ and study the class of functions that can be represented. Surprisingly, this linear calculus is extremely expressive: it is as powerful as System $\mathcal{T}$