# LNL-FPC: The Linear/Non-linear Fixpoint Calculus

@article{Lindenhovius2021LNLFPCTL, title={LNL-FPC: The Linear/Non-linear Fixpoint Calculus}, author={Bert Lindenhovius and Michael W. Mislove and Vladimir Zamdzhiev}, journal={Log. Methods Comput. Sci.}, year={2021}, volume={17} }

We describe a type system with mixed linear and non-linear recursive types called LNL-FPC (the linear/non-linear fixpoint calculus). The type system supports linear typing which enhances the safety properties of programs, but also supports non-linear typing as well which makes the type system more convenient for programming. Just as in FPC, we show that LNL-FPC supports type-level recursion which in turn induces term-level recursion. We also provide sound and computationally adequate…

## 8 Citations

Semantics for a Lambda Calculus for String Diagrams

- Computer Science
- 2020

This issue presents an adequacy result for the diagram-free fragment of the language which corresponds to a modified version of Benton and Wadler's adjoint calculus with recursion, and describes the influence of Samson Abramsky's research on these results.

Commutative Monads for Probabilistic Programming Languages

- Computer Science2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
- 2021

This paper shows how to use these monads to provide a sound and adequate denotational semantics for the Probabilistic FixPoint Calculus (PFPC) – a call-by-value simply-typed lambda calculus with mixed-variance recursive types, term recursion and probabilistic choice.

Quantum CPOs

- MathematicsElectronic Proceedings in Theoretical Computer Science
- 2021

The monoidal closed category qCPO of quantum cpos is introduced, whose objects are ‘quantized’ analogs of ω-complete partial orders (cpos) and is used to construct a sound model for the quantum programming language Proto-Quipper-M extended with term recursion.

Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory

- Computer ScienceFoSSaCS
- 2020

This paper constructs a sound categorical model for the quantum programming language QPL and provides the first detailed semantic treatment of user-defined inductive datatypes in quantum programming, and shows the denotational interpretation is invariant with respect to big-step reduction.

Semantics for variational Quantum programming

- Computer ScienceProc. ACM Program. Lang.
- 2022

A programming language that can manipulate both classical and quantum information and a very detailed denotational analysis that relates domain-theoretic models of classical probabilistic programming to models of quantum programming is considered.

L O ] 2 8 Ju l 2 02 1 1 Semantics for Variational antum Programming

- Computer Science
- 2021

The language is type-safe and designed for variational quantum programming, which is a hybrid classical-quantum computational paradigm, and the first denotational analysis that relates models of classical probabilistic programming to models of quantum programming is provided.

Computational Adequacy for Substructural Lambda Calculi

- Mathematics, Computer ScienceACT
- 2020

This work describes one linear and one affine type systems and forms abstract categorical models for both of them which are sound and computationally adequate, and presents a homogeneous categorical account of both linear and affinetype systems in a call-by-value setting.

Semantics for first-order affine inductive data types via slice categories

- Computer ScienceCMCS
- 2020

This paper considers a first-order affine type system with inductive data types and presents a novel categorical semantics for it and presents some concrete categorical models for the language ranging from classical to quantum.

## References

SHOWING 1-10 OF 41 REFERENCES

Mixed linear and non-linear recursive types

- Computer ScienceProc. ACM Program. Lang.
- 2019

A type system with mixed linear and non-linear recursive types called LNL-FPC (the linear/non-linear fixpoint calculus) and a new technique for solving recursive domain equations within the category CPO by constructing the solutions over pre-embeddings is described.

Linear Haskell: practical linearity in a higher-order polymorphic language

- Computer ScienceProc. ACM Program. Lang.
- 2018

This paper studied a linear type system designed with two crucial properties in mind: backwards-compatibility and code reuse across linear and non-linear users of a library, and implemented the type system in ghc, the leading Haskell compiler, and demonstrated two kinds of applications of linear types.

Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams

- Computer ScienceLICS
- 2018

This work presents an adequacy result for the diagram-free fragment of the language which corresponds to a modified version of Benton and Wadler's adjoint calculus with recursion, and extends the language with general recursion and proves soundness.

Semantics for a Lambda Calculus for String Diagrams

- Computer Science
- 2020

This issue presents an adequacy result for the diagram-free fragment of the language which corresponds to a modified version of Benton and Wadler's adjoint calculus with recursion, and describes the influence of Samson Abramsky's research on these results.

The best of both worlds: linear functional programming without compromise

- Computer Science, MathematicsICFP 2016
- 2016

This work presents a linear functional calculus with both the safety guarantees expressible with linear types and the rich language of combinators and composition provided by functional programming, and gives a formal basis for its claims of expressiveness.

Categories and types for axiomatic domain theory

- Mathematics
- 2003

A theory of structural algebraic compactness is established that allows us to describe the authors' models without reference to enrichment, and a canonical fixed point operation is constructed from the algebras provided by the algebraic Compactness of their models.

Linear logic propositions as session types

- Computer ScienceMathematical Structures in Computer Science
- 2014

A type system for the π-calculus is proposed that corresponds to a standard sequent calculus presentation of intuitionistic linear logic, interpreting linear propositions as session types and thus providing a purely logical account of all key features and properties of session types.

The category-theoretic solution of recursive domain equations

- Mathematics18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
- 1977

The purpose of the present paper is to set up a categorical framework in which the known techniques for solving equations find a natural place, generalizing from least fixed-points of continuous functions over cpos to initial ones of continuous functors over $\omega $-categories.

Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion

- MathematicsElectron. Notes Theor. Comput. Sci.
- 2000

Practical affine types

- Computer SciencePOPL '11
- 2011

This work introduces a prototype implementation of Alms, and establishes the soundness of the core language, and uses the core model to prove a principal kinding theorem.