The bang calculus revisited (Q6116183)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7713419

Language	Label	Description	Also known as
English	The bang calculus revisited	scientific article; zbMATH DE number 7713419

Statements

scholarly article

0 references

The bang calculus revisited (English)

0 references

10.1016/j.ic.2023.105047

0 references

Antonio Bucciarelli

0 references

0 references

Alejandro Ríos

0 references

0 references

Information and Computation

0 references

publication date

17 July 2023

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

call-by-push-value

0 references

bang calculus

0 references

intersection types

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ic.2023.105047

0 references

0 references

Open Call-by-Value

0 references

Types of fireballs

0 references

Programming languages and systems. 28th European symposium on programming, ESOP 2019, held as part of the European joint conferences on theory and practice of software, ETAPS 2019, Prague, Czech Republic, April 6--11, 2019. Proceedings

0 references

The Structural λ-Calculus

0 references

Call-by-Value Solvability, Revisited

0 references

The lambda calculus. Its syntax and semantics. Rev. ed.

0 references

A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization

0 references

Non-idempotent intersection types and strong normalisation

0 references

On phase semantics and denotational semantics: The exponentials

0 references

The bang calculus revisited

0 references

Non-idempotent intersection types for the Lambda-Calculus

0 references

A Semantical and Operational Account of Call-by-Value Solvability

0 references

Taylor expansion for Call-By-Push-Value

0 references

An extension of basic functionality theory for \(\lambda\)-calculus

0 references

Functional Characters of Solvable Terms

0 references

The Relational Model Is Injective for Multiplicative Exponential Linear Logic

0 references

Execution time of λ-terms via denotational semantics and intersection types

0 references

A semantic account of strong normalization in linear logic

0 references

A semantic measure of the execution time in linear logic

0 references

0 references

Call-By-Push-Value from a Linear Logic Point of View

0 references

Uniformity and the Taylor expansion of ordinary lambda-terms

0 references

0 references

0 references

Normal functors, power series and \(\lambda\)-calculus

0 references

0 references

0 references

0 references

Reductions of Residuals are Finite

0 references

Reasoning About Call-by-need by Means of Types

0 references

Quantitative Types for the Linear Substitution Calculus

0 references

0 references

Consuming and Persistent Types for Classical Logic

0 references

0 references

Call-by-push-value: Decomposing call-by-value and call-by-name

0 references

Call-by-name, call-by-value, call-by-need and the linear lambda calculus

0 references

Solvability in Resource Lambda-Calculus

0 references

An equivalence between lambda- terms

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6116183

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6116183&oldid=37541370"