52 Hits in 1.9 sec

Polytypic Programming in Maude

M. Clavel, F. Durán, N. Martí-Oliet
2000 Electronical Notes in Theoretical Computer Science  
In this paper we show that polytypic programming can be reduced to metaprogramming, and that can be developed in a reflective first-order language like Maude, without having to extend the language.  ...  So far, this programming style has been developed in functional languages like Haskell, extended with new syntactic constructs for defining polytypic programs.  ...  The extended language is called PolyP [17, 16] .  ... 
doi:10.1016/s1571-0661(05)80135-5 fatcat:wpq7lbbahzexxecmr4babjxcry

Comparing Approaches to Generic Programming in Haskell [chapter]

Ralf Hinze, Johan Jeuring, Andres Löh
2007 Lecture Notes in Computer Science  
The last decade has seen a number of approaches to generic programming: PolyP, Functorial ML, 'Scrap Your Boilerplate', Generic Haskell, 'Generics for the Masses', etc.  ...  The approaches vary in sophistication and target audience: some propose full-blown programming languages, some suggest libraries, some can be seen as categorical programming methods.  ...  We thank the participants of the 61st IFIP WG 2.1 meeting for their comments on a presentation about this work.  ... 
doi:10.1007/978-3-540-76786-2_2 fatcat:2mcmtbwsebg6fgdtt4sjd5y5wq

Polytypic Programming With Ease [chapter]

Ralf Hinze
1999 Lecture Notes in Computer Science  
This article proposes a new framework for a polytypic extension of functional programming languages. A polytypic functional program is one that is parameterised by datatype.  ...  However, polytypic programming is not necessarily more complicated than conventional programming.  ...  The classic approach to polytypic programming as realized in the polytypic programming language extension PolyP [14] is based on the initial algebra semantics of datatypes.  ... 
doi:10.1007/10705424_2 fatcat:wyauvjapuvd3fflpmbqsfwzzbq

Prototyping Generic Programming in Template Haskell [chapter]

Ulf Norell, Patrik Jansson
2004 Lecture Notes in Computer Science  
The design space of generic programming languages is largely unexplored, partly due to the time and eort required to implement such a language.  ...  In this paper we show how to write exible prototype implementations of two existing generic programming languages, PolyP and Generic Haskell, using Template Haskell, an extension to Haskell that enables  ...  3 we can start to implement our rst generic programming language, PolyP.  ... 
doi:10.1007/978-3-540-27764-4_17 fatcat:b4mbjaxomnggncabtd3ckbjkuy

Polytypic programming in COQ

Wendy Verbruggen, Edsko de Vries, Arthur Hughes
2008 Proceedings of the ACM SIGPLAN workshop on Generic programming - WGP '08  
For this goal to succeed, we must have a definition of polytypic programming which is both fully formal and as close as possible to the definition in Generic Haskell.  ...  The aim of our work is to provide an infrastructure for formal proofs over Generic Haskell-style polytypic programs.  ...  A nice feature of an implementation of polytypic programming in a dependently typed language is that the definition of a polytypic function is simply another record.  ... 
doi:10.1145/1411318.1411326 dblp:conf/icfp/VerbruggenVH08 fatcat:jvsglnjpena5phel2b2xfxsr6m

Calculate polytypically! [chapter]

Lambert Meertens
1996 Lecture Notes in Computer Science  
A polytypic function de nition is a function de nition that is parametrised with a datatype. It embraces a class of algorithms.  ...  As an example we de ne a simple polytypic \crush" combinator that can be used to calculate polytypically.  ...  u x) are in a pidgin based on functional languages like Haskell and Gofer.  ... 
doi:10.1007/3-540-61756-6_73 fatcat:tn5rgc2x3bezrceeepfj4sflpm

Polytypic Functions Over Nested Datatypes

Ralf Hinze
1999 Discrete Mathematics & Theoretical Computer Science  
International audience The theory and practice of polytypic programming is intimately connected with the initial algebra semantics of datatypes. This is both a blessing and a curse.  ...  We present several examples of polytypic functions, among others polytypic reduction and polytypic equality. The presentation assumes some background in functional and in polytypic programming.  ...  In the polytypic programming language PolyP [10] , for instance, the user must supply definitions for both polynomial and type functors.  ... 
doi:10.46298/dmtcs.266 fatcat:qicgzuajtfhdfa4u2vmunkdvey

Polytypic properties and proofs in Coq

Wendy Verbruggen, Edsko de Vries, Arthur Hughes
2009 Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming - WGP '09  
Moreover, the formalization can be seen as a machine verified proof that polytypic proof specialization is correct with respect to polytypic property specialization.  ...  We formalize proofs over Generic Haskell-style polytypic programs in the proof assistant Coq.  ...  Introduction In the never ending quest for higher levels of abstraction in programming language research, generic programming has been a hot topic in the functional programming community for a while (Jansson  ... 
doi:10.1145/1596614.1596616 dblp:conf/icfp/VerbruggenVH09 fatcat:4qgur4uh6fff5jp3bbaeze76b4

Page 1296 of Mathematical Reviews Vol. , Issue 2003B [page]

2003 Mathematical Reviews  
The printers and parsers are described in PolyP, a polytypic extension of the functional language Haskell.” 2003b:68025 68N15 68NI8 Palsberg, Jens (1-PURD-C; West Lafayette, IN); Zhao, Tian (1-PURD-C;  ...  Summary: “This paper discusses the compile time task scheduling of parallel programs running on a cluster of SMP workstations.  ... 

A lightweight implementation of generics and dynamics

James Cheney, Ralf Hinze
2002 Proceedings of the ACM SIGPLAN workshop on Haskell - Haskell '02  
The recent years have seen a number of proposals for extending statically typed languages by dynamics or generics.  ...  Most proposals -if not all -require significant extensions to the underlying language. In this paper we show that this need not be the case.  ...  is augmented with a Dynamic type and a typecase or cast construct; • polytypic programming [19, 5, 16] , in which type-dependent functions written in a language extension are translated to pure polymorphic  ... 
doi:10.1145/581690.581698 fatcat:kc3yyhi4xrdyjmukpnowzet5em

Transformation-by-Example for XML [chapter]

Shriram Krishnamurthi, Kathryn E. Gray, Paul T. Graunke
1999 Lecture Notes in Computer Science  
We illustrate the power of xt3d with several examples, including one reminiscent of polytypic programming that greatly simplifies the import of xml values into general-purpose languages.  ...  A growing number of applications that process xml documents are transformers, i.e., programs that convert documents between xml languages.  ...  language pretty-printer generates html listing a programming language interpreter runs program A surprising number of these actions involve transforming one xml language into another.  ... 
doi:10.1007/3-540-46584-7_17 fatcat:4mspkhif7fga5dle53mbt4ew34

A new approach to generic functional programming

Ralf Hinze
2000 Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '00  
This paper describes a new approach to generic functional programming, which allows us to define functions generically for all datatypes expressible in Haskell.  ...  Given this information a generic function can be specialized to arbitrary Haskell datatypes.  ...  Polyp-a polytypic programming language extension. In Conference Record 2&h ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'97, Paris, fiance, pages 470-482.  ... 
doi:10.1145/325694.325709 dblp:conf/popl/Hinze00 fatcat:3yvjrq7vt5hebozhcixu626qkm

Generic H∀SKELL, Specifically [chapter]

Dave Clarke, Andres Löh
2003 IFIP Advances in Information and Communication Technology  
Apart from extending the programming language Haskell, Hinze-style polytypism offers a simple approach to defining generic functions which are applicable to types of all kinds.  ...  Here we explore a number of simple but significant extensions to Hinze's ideas which make generic programming both more expressive and easier to use. We illustrate our ideas with examples.  ...  Introduction Generic or polytypic programming languages provide a medium for implementing functions whose behaviour is defined inductively on the structure of types.  ... 
doi:10.1007/978-0-387-35672-3_2 fatcat:4svrekkccfa7bkdp3p2mdgpsbq

An open and shut typecase

Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich
2005 Proceedings of the 2005 ACM SIGPLAN international workshop on Types in languages design and implementation - TLDI '05  
Ad-hoc polymorphism allows the execution of programs to depend on type information. It is a compelling addition to typed programming languages.  ...  Both approaches have their benefits, so it important to provide both capabilities in a single language. Therefore we present an expressive language that supports both forms of ad-hoc polymorphism.  ...  Ad-hoc polymorphism is a compelling addition to a typed programming language.  ... 
doi:10.1145/1040294.1040296 dblp:conf/tldi/VytiniotisWW05 fatcat:d37cigpoevfvdjj5wue43zmvoa

Strategic polymorphism requires just two combinators! [article]

Ralf Laemmel, Joost Visser
2002 arXiv   pre-print
This is done without commitment to a specific functional language. We analyse the design space for implementational models of functional strategies.  ...  Meanwhile, a number of Haskell-based models and combinator suites were proposed to support generic programming with functional strategies.  ...  The most prominent expressiveness to attempt a definition of hfoldr is presumably polytypism [18, 16, 13, 14, 15, 3] as implemented in PolyP and Generic Haskell.  ... 
arXiv:cs/0212048v1 fatcat:hn5yxlc655a67a7anr3rnxshuy
« Previous Showing results 1 — 15 out of 52 results