A prettier printer

Wadler, Philip; Kilmer, Joyce

doi:10.1007/978-1-349-91518-7_11

Cited by 39 publications

(43 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first five document constructors are taken from Wadler (2003). If rendering is implemented in the same way as in Wadler's work, then these combinators have the following meanings:…”

Section: Pretty-printersmentioning

confidence: 99%

“…• A pretty-printer for a kind of simplified XML documents, based on a pretty-printer described by Wadler (2003). The simplified XML grammar uses the bind operator to define the syntax of matching opening and closing tags.…”

Section: Other Examplesmentioning

confidence: 99%

“…$15.00. http://dx.doi.org/10.1145/2502409.2502410 (1980), Hughes (1995), Wadler (2003), and Swierstra and Chitil (2009). Libraries based on Hughes' approach tend to be set up more or less in the following way: There is a type Doc of pretty-printer documents, and a renderer render : Doc → String; the renderer often takes additional arguments, for instance the line width.…”

Section: Introductionmentioning

confidence: 99%

“…Doc, defined in Section 3, is based on the document type used by Wadler (2003), but is indexed by a grammar and a value. Note that, unlike a parse tree of type x ∈ g · s, a document of type Doc g x is not indexed by a string: a given document can (potentially) be turned into a string in many different ways.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Correct-by-construction pretty-printing

Danielsson

2013

Proceedings of the 2013 ACM SIGPLAN Workshop on Dependently-Typed Programming

View full text Add to dashboard Cite

A new approach to correct-by-construction pretty-printing is presented. The basic methodology is the one of classical (not necessarily correct) pretty-printing: users convert values to pretty-printer documents, and a general rendering algorithm turns documents into strings. The main novelty is that dependent types are used to ensure that, for each value, the constructed document is correct with respect to the value and a given grammar. Other parts of the development use well-established technology: the pretty-printer document interface is basically that of Wadler (2003), but with more precise types, and a single additional primitive combinator; and Wadler's rendering algorithm is used.It is proved that if a given value is pretty-printed, and the resulting string parsed (with respect to the same, unambiguous grammar), then the original value is obtained. No guarantees are made about "prettiness".

show abstract

“…The first five document constructors are taken from Wadler (2003). If rendering is implemented in the same way as in Wadler's work, then these combinators have the following meanings:…”

Section: Pretty-printersmentioning

confidence: 99%

Section: Other Examplesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Correct-by-construction pretty-printing

Danielsson

2013

Proceedings of the 2013 ACM SIGPLAN Workshop on Dependently-Typed Programming

View full text Add to dashboard Cite

show abstract

“…This approach is used, e.g., for the pretty printer library in Haskell where document layouts are described using a set of operators/functions in a language-like way [23].…”

Section: Language Embedding or Domain Specific Language?mentioning

confidence: 99%

Towards a Text Generation Template Language for Modelica

Fritzson

Privitzer²,

Sjölund

et al. 2009

Linköping Electronic Conference Proceedings

View full text Add to dashboard Cite

The uses, needs, and requirements of a text generation template language for Modelica are discussed. A template language may allow more concise and readable programming of the generation of textual models, program code, or documents, from a structured model representation such as abstract syntax trees (AST). Applications can be found in generating simulation code in other programming languages from models, generation of specialized models for various applications, generation of documentation, web pages, etc. We present several template language designs and some usage examples, both C code generation and Modelica model generation. Implementation is done in the OpenModelica environment. Two designs are currently operational.

show abstract

Extracting and Optimizing Formally Verified Code for Systems Programming

Ioannidis

Kaashoek

Zeldovich

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

MCQC is a compiler for extracting verified systems programs to low-level assembly, with no runtime or garbage collection requirements and an emphasis on performance. MCQC targets the Gallina functional language used in the Coq proof assistant. MCQC translates pure and recursive functions into C++17, while compiling monadic effectful functions to imperative C++ system calls. With a few memory and performance optimizations, MCQC combines verifiability with memory and runtime performance. By handling effectful and pure functions separately MCQC can generate executable verified code directly from Gallina, reducing the effort of implementing and executing verified systems.

show abstract

A prettier printer

Cited by 39 publications

References 1 publication

Correct-by-construction pretty-printing

Correct-by-construction pretty-printing

Towards a Text Generation Template Language for Modelica

Extracting and Optimizing Formally Verified Code for Systems Programming

Contact Info

Product

Resources

About