Preface to the special volume
From MaRDI portal
Publication:534064
DOI10.1016/j.tcs.2010.12.015zbMath1213.03043OpenAlexW4211175950MaRDI QIDQ534064
Publication date: 10 May 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.015
Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Interpreting a finitary pi-calculus in differential interaction nets
- Strong normalization property for second order linear logic
- Automatic synthesis of typed \(\Lambda\)-programs on term algebras
- The system \({\mathcal F}\) of variable types, fifteen years later
- The linear abstract machine
- The calculus of constructions
- Sequential algorithms on concrete data structures
- Decision problems for propositional linear logic
- A calculus of mobile processes. I
- Light linear logic
- Typing and computational properties of lambda expressions
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Linear continuation-passing
- Syntax vs. semantics: A polarized approach
- Locus Solum: From the rules of logic to the logic of rules
- A filter lambda model and the completeness of type assignment
- Focalisation and Classical Realisability
- The Expressiveness of Simple and Second-Order Type Structures
- Lambda‐Calculus Models and Extensionality
- A new constructive logic: classic logic
- Logic Programming with Focusing Proofs in Linear Logic
- Abstract Böhm trees
- The Logic of Bunched Implications
- Localisation and interaction in one dimension
- A Uniform Proof-theoretic Investigation of Linear Logic Programming
- Games and full completeness for multiplicative linear logic
- A new deconstructive logic: linear logic
- Bistructures, bidomains and linear logic
- Lilac: a functional programming language based on linear logic
- From petri nets to linear logic
- On the symmetry of sequentiality
This page was built for publication: Preface to the special volume