On the reification of semantic linearity

DOI10.1017/S0960129514000401zbMath1361.68064WikidataQ57722150 ScholiaQ57722150MaRDI QIDQ5741580

Luca Paolini, Marco Gaboardi, Mauro Piccolo

Publication date: 28 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

$$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations ⋮ QPCF: higher-order languages and quantum circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Gödel's system \(\mathcal T\) revisited
• The system \({\mathcal F}\) of variable types, fifteen years later
• BCK-combinators and linear \(\lambda\)-terms have types
• Sequential algorithms on concrete data structures
• Sequentiality in an extensional framework
• A theory of sequentiality
• The sequentially realizable functionals
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• A stable programming language
• Definability and Full Abstraction
• Linear Recursive Functions
• The Power of Linear Functions
• Program equivalence in a linear functional language
• Computing with Functionals—Computability Theory or Computer Science?