Transport of finiteness structures and applications

DOI10.1017/S0960129516000384zbMath1456.03108OpenAlexW2086979625MaRDI QIDQ4577981

Lionel Vaux, Christine Tasson

Publication date: 7 August 2018

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

Full work available at URL: https://doi.org/10.1017/s0960129516000384

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40) Foundations, relations to logic and deductive systems (18A15)

Related Items

Taylor expansion, finiteness and strategies, Unnamed Item, An introduction to differential linear logic: proof-nets, models and antiderivatives

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intuitionistic differential nets and lambda-calculus
• Differential interaction nets
• Typed lambda calculi and applications. 9th international conference, TLCA 2009, Brasilia, Brazil, July 1--3, 2009. Proceedings
• Bicategories of spans and relations
• Normal functors, power series and \(\lambda\)-calculus
• Pre-recursive categories
• Glueing and orthogonality for models of linear logic
• The differential lambda-calculus
• A non-uniform finitary relational semantics of system T
• Interpreting a Finitary Pi-calculus in Differential Interaction Nets
• Not Enough Points Is Enough
• Differential Linear Logic and Polarization
• The algebraic lambda calculus
• The Category-Theoretic Solution of Recursive Domain Equations
• Localisation and interaction in one dimension
• Container types categorically
• Execution time of λ-terms via denotational semantics and intersection types
• Recursive Functions with Pattern Matching in Interaction Nets
• Generic Programming
• Finiteness spaces
• Least and Greatest Fixed Points in Linear Logic
• Logical Approaches to Computational Barriers