A strong call-by-need calculus (Q6135746): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.46298/lmcs-19(1:21)2023 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.4230/lipics.fscd.2021.9 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A nonstandard standardization theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distilling abstract machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strong Distillery / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structural λ-Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to fully lazy sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak optimality, and the meaning of sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An abstract machine for strong call by value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5089007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abella: A System for Reasoning about Relational Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-idempotent intersection types for the Lambda-Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong call-by-need calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of basic functionality theory for \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Call-by-Need Lambda Calculus, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The locally nameless representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric higher-order abstract syntax for mechanized semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compiled implementation of strong reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Explicit Substitutions with Safe and Full Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning About Call-by-need by Means of Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Types for the Linear Substitution Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Bigraphs and Confluence: Two Conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The call-by-need lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call-by-name, call-by-value and the \(\lambda\)-calculus / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.46298/LMCS-19(1:21)2023 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.FSCD.2021.9 / rank
 
Normal rank

Latest revision as of 18:45, 30 December 2024

scientific article; zbMATH DE number 7731910
Language Label Description Also known as
English
A strong call-by-need calculus
scientific article; zbMATH DE number 7731910

    Statements

    A strong call-by-need calculus (English)
    0 references
    0 references
    0 references
    0 references
    26 August 2023
    0 references
    23 June 2023
    0 references
    strong reduction
    0 references
    call-by-need
    0 references
    evaluation strategy
    0 references
    normalization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references