Polynomial-time optimal pretty-printing combinators with choice (Q3455076)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6515891
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time optimal pretty-printing combinators with choice |
scientific article; zbMATH DE number 6515891 |
Statements
Polynomial-Time Optimal Pretty-Printing Combinators with Choice (English)
0 references
3 December 2015
0 references
pretty-printing
0 references
combinators
0 references
bottom-up rewriting systems
0 references
0.7527507543563843
0 references
0.6706490516662598
0 references
0.6655526757240295
0 references
0.6607147455215454
0 references
0.6581129431724548
0 references
