# Call-by-Value Non-determinism in a Linear Logic Type Discipline

@article{DazCaro2013CallbyValueNI,
title={Call-by-Value Non-determinism in a Linear Logic Type Discipline},
author={Alejandro D{\'i}az-Caro and Giulio Manzonetto and Michele Pagani},
journal={ArXiv},
year={2013},
volume={abs/1312.4507}
}
• Published 6 January 2013
• Computer Science
• ArXiv
We consider the call-by-value λ-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent intersection types, we endow this calculus with a type system based on the so-called Girard’s second translation of intuitionistic logic into linear logic. We prove that a term is typable if and only if it is converging, and that its typing tree carries enough…
20 Citations

### Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus

This work investigates the possibility of a semantic account of the execution time for the shuffling calculus, an extension of Plotkin's call-by-value lambda-calculus, using a linear logic based denotational model that can be seen as a non-idempotent intersection type system: relational semantics.

### Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus (Long Version)

• Computer Science
• 2018
This work investigates the possibility of a semantic account of the execution time for the shuffling calculus, an extension of Plotkin’s call-by-value λ -calculus, using a linear logic based denotational model that can be seen as a nonidempotent intersection type system: relational semantics.

### Types by Need (Extended Version)

• Computer Science
ArXiv
• 2019
A cornerstone of the theory of lambda-calculus is that intersection types characterise termination properties. They are a flexible tool that can be adapted to various notions of termination, and that

### Types of Fireballs (Extended Version)

• Computer Science
ArXiv
• 2018
This study relies on a new, refined presentation of the fireball calculus, the simplest proposal for open call-by-value, that is more apt to denotational investigations, and its type system characterises normalisation and thus provides an adequate relational semantics.

### The Vectorial Lambda-Calculus

• Computer Science, Mathematics
ArXiv
• 2013
It is proved that the resulting typed lambda-calculus is strongly normalising and features a weak subject reduction and it is shown how to naturally encode matrices and vectors in this typed calculus.

### The vectorial λ-calculus

• Mathematics, Computer Science
Inf. Comput.
• 2017

### Simply Typed Lambda-Calculus Modulo Type Isomorphisms

• Mathematics, Computer Science
ArXiv
• 2015
A simply typed, non-deterministic lambda-calculus where isomorphic types are equated and an equivalence relation is settled at the term level is defined and a proof of strong normalisation modulo equivalence is provided.

### Isomorphisms considered as equalities: Projecting functions and enhancing partial application through an implementation of λ+

• Computer Science, Mathematics
IFL '15
• 2015
An implementation of λ+, a recently introduced simply typed lambda-calculus with pairs where isomorphic types are made equal, which allows for a novel way of program transformation by reduction, by projecting a function before it is applied in order to simplify it.

### Tight typings and split bounds

• Computer Science
Proc. ACM Program. Lang.
• 2018
The two main novelties are exact split bounds for the leftmost strategy—the only known strategy that evaluates terms to full normal forms and provides a reasonable complexity measure—and the observation that the computing device hidden behind multi types is the notion of substitution at a distance, as implemented by the linear substitution calculus.

### Types of Fireballs Beniamino Accattoli , Giulio Guerrieri

• Computer Science
• 2019
This study relies on a new, refined presentation of the fireball calculus, the simplest proposal for open call-by-value, that is more apt to denotational investigations, and its type system characterises normalisation and thus provides an adequate relational semantics.

## References

SHOWING 1-10 OF 26 REFERENCES

### Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types

• Mathematics
FoSSaCS
• 2011
A typing system for the λ-calculus, with nonidempotent intersection types, and a result that is the counterpart of de Carvalho's result for linear head-reduction sequences.

### Collapsing non-idempotent intersection types

This work construction of a new model, which features a new duality, is presented, and how to use it for reducing normalization results in idempotent intersection types to purely combinatorial methods is explained.

### Lambda-Calculi for (Strict) Parallel Functions

We introduce two ?-calculi and show that they are expressive for two canonical domains of parallel functions. The first calculus is an enrichment of the lazy, call-by-name ?-calculus with

### A Filter Model for Concurrent lambda-Calculus

• Computer Science
SIAM J. Comput.
• 1998
Type-free lazy $\lambda$-calculus is enriched with angelic parallelism and demonic nondeterminism, and the induced logical semantics is fully abstract.

### Free-Algebra Models for the pi-Calculus

A novel algebraic description for models of the @p-calculus is obtained, and an existing construction is validated as the universal such model, and it is generalised to prove that all free-algebra models are fully abstract.

### Linear-algebraic lambda-calculus: higher-order, encodings, and confluence

• Computer Science, Mathematics
RTA
• 2008
A minimal language combining higher-ordercomputation and linear algebra is introduced, and the confluence of the calculus is proved, this is the main result.

### Domains and lambda-calculi

• Computer Science
Cambridge tracts in theoretical computer science
• 1998
This chapter discusses the development of lambda-calculi in CCC's of algebraic dcpo's, as well as its applications in recursion theory and category theory.