Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (Q3558344): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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-12251-4_20 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077032343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct proof of the finite developments theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Undecidability in Term Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models of computation. An introduction to computability theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5824357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. Vol. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The typed lambda-calculus is not elementary recursive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4799892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for standardizations and an application / rank
 
Normal rank

Latest revision as of 19:41, 2 July 2024

scientific article
Language Label Description Also known as
English
Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus
scientific article

    Statements

    Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (English)
    0 references
    0 references
    0 references
    4 May 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references