On the reification of semantic linearity
From MaRDI portal
Publication:5741580
DOI10.1017/S0960129514000401zbMATH Open1361.68064WikidataQ57722150 ScholiaQ57722150MaRDI QIDQ5741580FDOQ5741580
Authors: Marco Gaboardi, Luca Paolini, Mauro Piccolo 
Publication date: 28 July 2016
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Recommendations
Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)
Cites Work
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear logic
- The system \({\mathcal F}\) of variable types, fifteen years later
- Linear Recursive Functions
- Gödel's system \(\mathcal T\) revisited
- Computing with Functionals—Computability Theory or Computer Science?
- Title not available (Why is that?)
- A stable programming language
- The sequentially realizable functionals
- Title not available (Why is that?)
- Sequential algorithms on concrete data structures
- The Power of Linear Functions
- Sequentiality in an extensional framework
- BCK-combinators and linear \(\lambda\)-terms have types
- A theory of sequentiality
- Definability and full abstraction
- Program equivalence in a linear functional language
Cited In (8)
- QPCF: higher-order languages and quantum circuits
- Linearity and PCF: a semantic insight!
- Linearity: a roadmap
- A Process-Model for Linear Programs
- Semantic Barbs and Biorthogonality
- Quasi-linear Dialectica Extraction
- A forgotten strand of reception history: understanding pure semantics
- \textsc{qPCF}: a language for quantum circuit computations
This page was built for publication: On the reification of semantic linearity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741580)
