Simple type inference for term graph rewriting systems (Q5881175): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redex capturing in term graph rewriting (concise version) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Principal Type-Scheme of an Object in Combinatory Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transfinite reductions in orthogonal term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of type polymorphism in programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Co-induction in relational semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type inference for polymorphic references / rank
 
Normal rank

Latest revision as of 16:48, 31 July 2024

scientific article; zbMATH DE number 7661538
Language Label Description Also known as
English
Simple type inference for term graph rewriting systems
scientific article; zbMATH DE number 7661538

    Statements