Generic programming with fixed points for mutually recursive datatypes

Yakushev, Alexey Rodriguez; Holdermans, Stefan; Löh, Andres; Jeuring, Johan

doi:10.1145/1596550.1596585

Cited by 46 publications

(24 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Despite the redundant Unit and ⊥ types, these functors are isomorphic to the functors used to represent lists of numbers and 2-3 trees (Gibbons 2007;Yakushev et al 2009). To make our code more readable, we will omit the functor argument X and the subscripts a, p , s in the interpretation function ty X , whenever these may be inferred from the context.…”

Section: Datatype Re Ectionmentioning

confidence: 99%

Type-directed diffing of structured data

Miraldo

Dagand

Swierstra

2017

Proceedings of the 2nd ACM SIGPLAN International Workshop on Type-Driven Development

View full text Add to dashboard Cite

The Unix diff utility that compares lines of text is used pervasively by version control systems. Yet certain changes to a program may be di cult to describe accurately in terms of modi cations to individual lines of code. As a result, observing changes at such a xed granularity may lead to unnecessary con icts between di erent edits. This paper presents a generic representation for describing transformations between algebraic data types and a non-deterministic algorithm for computing such representations. These representations can be used to give a more accurate account of modi cations made to algebraic data structures -and the abstract syntax trees of computer programs in particular -as opposed to only considering modi cations between their textual representations.

show abstract

Section: Datatype Re Ectionmentioning

confidence: 99%

Type-directed diffing of structured data

Miraldo

Dagand

Swierstra

2017

Proceedings of the 2nd ACM SIGPLAN International Workshop on Type-Driven Development

View full text Add to dashboard Cite

show abstract

“…Multirec (Rodriguez Yakushev et al 2009) is a library for generic programming supporting families of mutually recursive datatypes. It can be seen as a generalisation of Regular, using indexed functors instead of plain functors for the generic representation.…”

Section: Improving Multirecmentioning

confidence: 99%

The right kind of generic programming

Magalhães

2012

Proceedings of the 8th ACM SIGPLAN Workshop on Generic Programming

View full text Add to dashboard Cite

Haskell is known for its strong, static type system. A good type system classifies values, constraining the valid terms of the language and preventing many common programming errors. The Glasgow Haskell Compiler (GHC) has further extended the type language of Haskell, adding support for type-level computation and explicit type equality constraints.Type-level programming is used to classify values, but types themselves have remained notoriously unclassified. Recently, however, the kind-level language was extended with support for userdefined kinds and kind polymorphism. In this paper we revisit generic programming approaches that rely heavily on type-level computation, and analyse how to improve them with the extended kind language. For instructive purposes, we list a series of advantages given by the new features, and also a number of shortcomings that prevent desirable use patterns.

show abstract

“…This is a well-studied problem, and a variety of approaches have been proposed (Hinze 2000;Peyton Jones 2003, 2004;Löh 2004;Visser 2005;Rodriguez et al 2008;Yakushev et al 2009;Magalhães et al 2010). This section describes one such approach to the problem: the Kansas University Rewrite Engine (KURE), a Haskell-embedded domain-specific language for strategic rewriting.…”

Section: Strategic Rewritingmentioning

confidence: 99%

The HERMIT in the machine

Sculthorpe

2012

SIGPLAN Not.

View full text Add to dashboard Cite

The importance of reasoning about and refactoring programs is a central tenet of functional programming. Yet our compilers and development toolchains only provide rudimentary support for these tasks. This paper introduces a programmatic and compiler-centric interface that facilitates refactoring and equational reasoning. To develop our ideas, we have implemented HERMIT, a toolkit enabling informal but systematic transformation of Haskell programs from inside the Glasgow Haskell Compiler's optimization pipeline. With HERMIT, users can experiment with optimizations and equational reasoning, while the tedious heavy lifting of performing the actual transformations is done for them.HERMIT provides a transformation API that can be used to build higher-level rewrite tools. One use-case is prototyping new optimizations as clients of this API before being committed to the GHC toolchain. We describe a HERMIT application-a readeval-print shell for performing transformations using HERMIT. We also demonstrate using this shell to prototype an optimization on a specific example, and report our initial experiences and remaining challenges.

show abstract

Generic programming with fixed points for mutually recursive datatypes

Cited by 46 publications

References 29 publications

Type-directed diffing of structured data

Type-directed diffing of structured data

The right kind of generic programming

The HERMIT in the machine

Contact Info

Product

Resources

About