Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
Least upper bounds on the size of Church-Rosser diagrams in term rewriting and λ-calculus
Jeroen Ketema,
Jakob Grue Simonsen
Department of Computer Science
1
Citation (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Least upper bounds on the size of Church-Rosser diagrams in term rewriting and λ-calculus'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Term Rewriting
100%
Term Rewriting Systems
71%
Diagram
63%
Calculus
58%
Upper bound
48%
Confluence
22%
Hierarchy
15%
Term
9%