Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus (Q672060): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3342534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The calculus of constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5667469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining first order algebraic rewriting systems, recursion and extensional lambda calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating expansions without expansions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5580926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal category theory: Adjointness for 2-categories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The virtues of eta-expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815296 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(96)80713-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4210699837 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:38, 30 July 2024

scientific article
Language Label Description Also known as
English
Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus
scientific article

    Statements

    Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus (English)
    0 references
    0 references
    27 February 1997
    0 references
    simply typed 2\(\lambda\)-calculus
    0 references
    equational theory
    0 references
    word problem
    0 references
    confluence
    0 references
    catagorical rewriting
    0 references

    Identifiers