Detecting global variables in denotational specifications
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Theoretical Computer Science
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Communication and concurrency
Is there a use for linear logic?
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
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
Kripke logical relations and PCF
Information and Computation
Parametricity and local variables
Journal of the ACM (JACM)
Handbook of logic in computer science (vol. 3)
Full abstraction for the second order subset of an ALGOL-like language
MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
ALGOL-like languages (v.2)
ALGOL-like Languages, Volume 1
The varieties of programming language
ALGOL-like Languages, Volume 1
Syntactic control of interference
ALGOL-like Languages, Volume 1
Syntactic control of interference revisited
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Objects, interference, and the Yoneda embedding
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Information and Computation
The Craft of Programming
Principles of Programming Languages
Principles of Programming Languages
Proceedings of the International Conference on Typed Lambda Calculi and Applications
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Term Calculus for Intuitionistic Linear Logic
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Logic for Parametric Polymorphism
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Stable Models of Typed lambda-Calculi
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
A Relational Account of Call-by-Value Sequentially
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A category-theoretic approach to the semantics of programming languages
A category-theoretic approach to the semantics of programming languages
The logical approach to stack typing
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Higher-Order and Symbolic Computation
Higher-Order and Symbolic Computation
Abstract Syntax and Variable Binding for Linear Binders
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Resource Interpretations, Bunched Implications and the alpha lambda-Calculus
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Local Reasoning about Programs that Alter Data Structures
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Reasoning about Idealized ALGOL Using Regular Languages
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Information and Computation
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Reasoning about local variables with operationally-based logical relations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The regular-language semantics of second-order idealized ALGOL
Theoretical Computer Science
Journal of Functional Programming
Correctness of data representations involving heap data structures
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
A step-indexed model of substructural state
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
A fibrational framework for possible-world semantics of Algol-like languages
Theoretical Computer Science
L3: A Linear Language with Locations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Functional translation of a calculus of capabilities
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Linear types for computational effects
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Monoidal Indeterminates and Categories of Possible Worlds
Electronic Notes in Theoretical Computer Science (ENTCS)
Relational parametricity and separation logic
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Correctness of data representations involving heap data structures
ESOP'03 Proceedings of the 12th European conference on Programming
Enriching an effect calculus with linear types
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
A Nominal Relational Model for Local Store
Electronic Notes in Theoretical Computer Science (ENTCS)
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
A typed store-passing translation for general references
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Linearly-used state in models of call-by-value
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Relational reasoning in a nominal semantics for storage
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
L3: a linear language with locations
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Reduction in a linear lambda-calculus with applications to operational semantics
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Monoidal indeterminates and categories of possible worlds
Theoretical Computer Science
An automata-theoretic model of idealized algol
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
L$^3$: A Linear Language with Locations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
On monadic parametricity of second-order functionals
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Automata-Theoretic Semantics of Idealized Algol with Passive Expressions
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.01 |
In a linearly-typed functional language, one can define functions that consume their arguments in the process of computing their results. This is reminiscent of state transformations in imperative languages, where execition of an assignment statement alters the contents of the store. We explore this connection by translating two variations on Algol 60 into a purely functional language with polymorphic linear types. On the one hand, the translations lead to a semantic analysis of Algol-like programs, in terms of a model of the linear language. On the other hand, they demonstrate that a linearly-typed functional language can be at least as expressive as Algol.