Sciweavers

38 search results - page 5 / 8
» Functor Categories and Two-Level Languages
Sort
View
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 4 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
POPL
2008
ACM
14 years 8 months ago
Foundations for structured programming with GADTs
GADTs are at the cutting edge of functional programming and become more widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood. In ...
Patricia Johann, Neil Ghani
POPL
2007
ACM
14 years 8 months ago
PADS/ML: a functional data description language
Massive amounts of useful data are stored and processed in ad hoc formats for which common tools like parsers, printers, query engines and format converters are not readily availa...
Artem Gleyzer, David Walker, Kathleen Fisher, Mary...
ICALP
2004
Springer
14 years 1 months ago
Representing Nested Inductive Types Using W-Types
We show that strictly positive inductive types, constructed from polynomial functors, constant exponentiation and arbitrarily nested inductive types exist in any Martin-L¨of categ...
Michael Abbott, Thorsten Altenkirch, Neil Ghani
FPCA
1995
13 years 11 months ago
Bananas in Space: Extending Fold and Unfold to Exponential Types
Fold and unfold are general purpose functionals for processing and constructing lists. By using the categorical approach of modelling recursive datatypes as fixed points of funct...
Erik Meijer, Graham Hutton