Towards a categorical foundation for generic programming

Hinze, Ralf; Wu, Nicolas

doi:10.1145/2036918.2036926

Cited by 4 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The reason we have chosen the iTask system as host for our web-editors for DSLs is that it can derive those editors for algebraic datatypes. This is done by type generic programming [1,4,8]. The idea is that Clean knows how to transform between a datatype and its generic representation.…”

Section: Algebraic Data Types For Queriesmentioning

confidence: 99%

Dynamic Editors for Well-Typed Expressions

Koopman

Michels²,

Plasmeijer

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Interactive systems may require complex inputs. Domain experts prefer guidance in the construction of these inputs. An ideal system prevents errors and is flexible in the construction and changes of its input. The iTask system generates web-editors given any firstorder algebraic data types. The generated web-editors are useful but have their limitations. It is not possible to combine type safety with overloaded operators and preventing unbounded or ill-typed identifiers is impossible. Using phantom types, generalized algebraic datatypes or functions solves the language problems, but they cannot be handled by the datatype generic system. Moreover, changing expressions can require re-entering large parts of the input. We present dynamic editors that can solve all those problems. The programmer specifies the elements of such an editor by functions. The system shows the applicable edit elements in a drop-down menu to the user. The dynamic editor is used recursively to create the arguments for the selected function. Dynamic editors are seamlessly integrated with the ordinary web-editors of the iTask system. The obtained editors guide the users to make correct and type-safe inputs. These editors can be very flexible as well without making strange abstract syntax trees.

show abstract

Section: Algebraic Data Types For Queriesmentioning

confidence: 99%

Dynamic Editors for Well-Typed Expressions

Koopman

Michels²,

Plasmeijer

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…One advantage of Haskell is that the introduction of memoization can be performed easily, as demonstrated by Hinze 6 . Furthermore, the ideas from that article are implemented in the package Data.MemoTrie 7 .…”

Section: Memoizationmentioning

confidence: 99%

Easily solving dynamic programming problems in Haskell by memoization of hylomorphisms

Llorens

Vilar

2020

Softw Pract Exp

View full text Add to dashboard Cite

Summary Dynamic programming is a well‐known algorithmic technique that solves problems by a combination of dividing a problem into subproblems and using memoization to avoid an exponential growth of the costs. We show how to implement dynamic programming in Haskell using a variation of hylomorphisms that includes memoization. Our implementation uses polymorphism so the same function can return the best score or the solution to the problem based on the type of the returned value.

show abstract

“…In our setting, this allows us to carry around information about the auxiliary function. In fact, this technique of using a slice category has been used to give a semantics to generic functions by the authors in (Hinze & Wu, 2011); much of the background required is identical, and we repeat it here.…”

Section: Detour: Zygomorphisms From Slice Categoriesmentioning

confidence: 99%

Unifying structured recursion schemes

Hinze¹,

Wu²

2016

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

Folds and unfolds have been understood as fundamental building blocks for total programming, and have been extended to form an entire zoo of specialised structured recursion schemes. A great number of these schemes were unified by the introduction of adjoint folds, but more exotic beasts such as recursion schemes from comonads proved to be elusive. In this paper, we show how the two canonical derivations of adjunctions from (co)monads yield recursion schemes of significant computational importance: monadic catamorphisms come from the Kleisli construction, and more astonishingly, the elusive recursion schemes from comonads come from the Eilenberg–Moore construction. Thus, we demonstrate that adjoint folds are more unifying than previously believed.

show abstract

Towards a categorical foundation for generic programming

Cited by 4 publications

References 19 publications

Dynamic Editors for Well-Typed Expressions

Dynamic Editors for Well-Typed Expressions

Easily solving dynamic programming problems in Haskell by memoization of hylomorphisms

Unifying structured recursion schemes

Contact Info

Product

Resources

About