Three Syntactic Theories for Combinatory Graph Reduction (Q3003482): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DACTL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-20551-4_1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2268291652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of a first-order functional language with sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The call-by-need lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4890709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank
 
Normal rank
Property / cites work
 
Property / cites work: LEAN: An intermediate language based on graph rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Apparent variables from the standpoint of combinatory logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Reduction-Based to Reduction-Free Normalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defunctionalized Interpreters for Call-by-Need Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lazy evaluation and delimited control / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational formalization for partial evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3918095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On global dynamics of optimal graph reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The call-by-need lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-step and big-step semantics for call-by-need / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5626301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new implementation technique for applicative languages / rank
 
Normal rank

Latest revision as of 02:07, 4 July 2024

scientific article
Language Label Description Also known as
English
Three Syntactic Theories for Combinatory Graph Reduction
scientific article

    Statements

    Three Syntactic Theories for Combinatory Graph Reduction (English)
    0 references
    0 references
    0 references
    27 May 2011
    0 references

    Identifiers