166,655 Hits in 8.8 sec

On the implementation of construction functions for non-free concrete data types [article]

Frédéric Blanqui, Thérèse Hardin
2007 arXiv   pre-print
In this paper, we detail the notion of private data type and study the existence of construction functions. We also describe a prototype, called Moca, that addresses the entire problem of...  ...  The common way of ensuring consistency is to use an abstract data type for the representatives; unfortunately, pattern matching on representatives is lost.  ...  Ø Ø ØÝÔ × Û Ø ÔÖ Ú Ø ÓÒ×ØÖÙØÓÖ× Ï Ö×Ø Ö ÐÐ Ø Ò Ø ÓÒ Ó Ö×عÓÖ Ö Ø ÖÑ Ð Ö º ÁØ Û ÐÐ Ù× ÙÐ ÓÖ Ò Ò Ø Ú ÐÙ × Ó ÓÒÖ Ø Ò ÔÖ Ú Ø Ø ØÝÔ ×º Ò Ø ÓÒ ½´ Ö×عÓÖ Ö Ø ÖÑ Ð Ö µ ×ÓÖØ Ø ÖÑ Ð Ö Ò Ø ÓÒ × ØÖ ÔÐ Ø A = (S, C,  ... 
arXiv:cs/0701031v1 fatcat:sbgd6cz46je2xgw5lop2rf75da

On the Implementation of Construction Functions for Non-free Concrete Data Types [chapter]

Frédéric Blanqui, Thérèse Hardin, Pierre Weis
2007 Lecture Notes in Computer Science  
The authors thank Claude Kirchner for his comments on a previous version of the paper.  ...  Thompson describes a mechanism introduced in the Miranda functional programming language for implementing such non-free concrete data types without precluding pattern matching.  ...  For building values, one must use construction functions as in abstract data types.  ... 
doi:10.1007/978-3-540-71316-6_8 fatcat:fcj5mdwlm5f7xjym7lpzvoid5i

Embeddable framework for syntax-safe source code generation

Evgenii Kotelnikov
2012 Proceedings of the 2012 Joint International Conference on Human-Centered Computer Environments - HCCE '12  
The common technology based on code templates is often cumbersome and error-prone.  ...  This paper introduces syngen 1 , an automatic tool, written in Scheme, designed to produce frameworks for building syntactically correct fragments of source code.  ...  To manage correct composition of values of these data structures it is proposed to establish one-to-one correspondence between non-terminals and types in some type system, and then map relations between  ... 
doi:10.1145/2160749.2160769 dblp:conf/hcce/Kotelnikov12 fatcat:g25ij6t46bbn3bcr3kmcgu5wxm

Generic Programming with Combinators and Objects [article]

Dmitrii Kosarev, Dmitry Boulytchev
2021 arXiv   pre-print
The support for polymorphic variant types complements the ability to describe composable data types with the ability to implement composable transformations.  ...  We present a generic programming framework for OCAML which makes it possible to implement extensible transformations for a large scale of type definitions.  ...  On the Figure 1 we describe the concrete constructs, implemented by the syntax extensions.  ... 
arXiv:2106.01250v1 fatcat:eqw6isim5zb3zc2pzgo7xwaut4

Emulating Multiple Inheritance in Fortran 2003/2008

Karla Morris
2015 Scientific Programming  
The design unleashes the power of the associated class relationships for modeling complicated data structures yet avoids the ambiguities that plague some multiple inheritance scenarios.  ...  The advent of widespread compiler support for Fortran 2003 now facilitates explicitly constructing object-oriented class hierarchies via inheritance and leveraging related class behaviors such as dynamic  ...  Department of Energy under Contract DE-AC04-94AL85000. The author thanks Damian Rouson for the helpful discussions and guidance.  ... 
doi:10.1155/2015/126069 fatcat:zy6ptua2b5hgpo5ye7vvywzx5e

Calculating modules in contextual logic program refinement [article]

Robert Colvin, Ian J. Hayes, Paul Strooper
2006 arXiv   pre-print
A module is a collection of procedures that operate on a common data type; module refinement between a specification module A and an implementation module C allows calls to the procedures of A to be systematically  ...  Based on the conditions for module refinement, we present a method for calculating an implementation module from a specification module.  ...  The authors would like to thank David Hemer and three anonymous referees for constructive comments on earlier versions of the paper.  ... 
arXiv:cs/0608110v1 fatcat:345pyz34gjevddpo3e2c45xktq

Lazy and Enforceable Assertions for Functional Logic Programs [chapter]

Michael Hanus
2011 Lecture Notes in Computer Science  
Assertions or contracts are an important technique to improve the quality of software. Thus, assertions are also desirable for functional logic programming.  ...  We describe a prototypical implementation of this idea in the functional logic language Curry where the programmer can choose between lazy and enforceable assertions.  ...  The author is grateful to the participants of WFLP 2010 and the anonymous referees for helpful comments and suggestions to improve this paper.  ... 
doi:10.1007/978-3-642-20775-4_5 fatcat:ezagyqe2vrhsnckteznbffzg6i

A type system for functional traversal-based aspects

Bryan Chadwick, Karl Lieberherr
2009 Proceedings of the 2009 workshop on Foundations of aspect-oriented languages - FOAL '09  
Computation in AP-F is encapsulated in sets of functions that implement a fold over a data structure with the help of a generic traversal.  ...  We present a programming language model of the ideas behind Functional Adaptive Programming (AP-F) and our Java implementation, DemeterF.  ...  The implementation of choose selects the function in a set with a first argument that matches the given type. Substitution is the typical replacement of e for all free occurrences of x in e.  ... 
doi:10.1145/1509837.1509839 dblp:conf/foal/ChadwickL09 fatcat:gukr6eitebd6rdwqaa6xxumgpq

Declarative Programming of User Interfaces [chapter]

Michael Hanus, Christof Kluß
2008 Lecture Notes in Computer Science  
We sketch an implementation of this concept in the declarative multi-paradigm programming language Curry and show how the integrated functional and logic features of Curry are exploited to enable a high-level  ...  Thus, our approach combines the advantages of existing user interface technologies in a flexible way without demands on the programmer's side.  ...  Since no constructor of this data type is available to the user of the UI library, the only reasonable way to use values of type UIRef is with a free variable (see below for a concrete example).  ... 
doi:10.1007/978-3-540-92995-6_2 fatcat:xgtlowfjdbce5duf66ucghyimi

Smten with satisfiability-based search

Richard Uhler, Nirav Dave
2014 Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications - OOPSLA '14  
For these applications to scale to larger problem instances, developers cannot rely solely on the sophistication of SAT and SMT solvers to efficiently solve their queries; they must also optimize their  ...  own orchestration and construction of queries.  ...  The views, opinions, and/or findings contained in this report are those of the authors and should not be interpreted as representing the official views or policies, either expressed or implied, of the  ... 
doi:10.1145/2660193.2660208 dblp:conf/oopsla/UhlerD14 fatcat:shmldn2t3re5jolm3x3xzpzsja

Reuseware — Adding Modularity to Your Language of Choice

Jakob Henriksson, Jendrik Johannes, Steffen Zschaler, Uwe Aßmann
2007 Journal of Object Technology  
This paper presents a generic approach for adding modularity to arbitrary languages, discussing the underlying concepts and presenting the Reuseware Composition Framework.  ...  Developers of such languages focus on their specific domains rather than on technical challenges of language design. Generic features of languages are rarely included in special-purpose languages.  ...  ACKNOWLEDGMENT This research has been co-funded by the European Commission and by the Swiss Federal Office for Education and Science within the 6th Framework Programme project REW-ERSE number 506779 (cf  ... 
doi:10.5381/jot.2007.6.9.a7 fatcat:slizci6bd5fc3exbs52gronsyi

Smten with satisfiability-based search

Richard Uhler, Nirav Dave
2014 SIGPLAN notices  
For these applications to scale to larger problem instances, developers cannot rely solely on the sophistication of SAT and SMT solvers to efficiently solve their queries; they must also optimize their  ...  own orchestration and construction of queries.  ...  The views, opinions, and/or findings contained in this report are those of the authors and should not be interpreted as representing the official views or policies, either expressed or implied, of the  ... 
doi:10.1145/2714064.2660208 fatcat:xjauvvvvkzgi7ccxe7kt6lhks4

Apron: A Library of Numerical Abstract Domains for Static Analysis [chapter]

Bertrand Jeannet, Antoine Miné
2009 Lecture Notes in Computer Science  
Its goal is threefold: provide analysis implementers with ready-to-use numerical abstractions under a unified API, encourage the research in numerical abstract domains by providing a platform for integration  ...  This article describes Apron, a freely available library dedicated to the static analysis of the numerical variables of programs by abstract interpretation.  ...  Sound conversion functions are provided so that the developer can choose the most convenient arithmetic type to use internally and still handle all the API data-types available to the user (e.g., polyhedra  ... 
doi:10.1007/978-3-642-02658-4_52 fatcat:7sak2skdenatjm6jp733jji6wi

Modular language implementation in Rascal – experience report

Bas Basten, Jeroen van den Bos, Mark Hills, Paul Klint, Arnold Lankamp, Bert Lisser, Atze van der Ploeg, Tijs van der Storm, Jurgen Vinju
2015 Science of Computer Programming  
And just like in ordinary software construction, modular implementations can help ease the process of changing a language implementation and its dependent tools.  ...  Rascal supports extensible definition of concrete syntax, abstract syntax and operations on concrete and abstract syntax trees like matching, traversal and transformation.  ...  the concrete syntax trees defined by such grammars are first-class values, and non-terminals are first-class types. • Built-in data types: apart from the standard data types (int, bool, string etc.), Rascal  ... 
doi:10.1016/j.scico.2015.11.003 fatcat:oiaibnclkjeglma2tx3xe6sudi

Dioids for Computational Effects

Ezequiel Postan, Exequiel Rivas, Mauro Jaskelioff
2018 Electronical Notes in Theoretical Computer Science  
Moreover, we study the construction of free dioids in a programming context.  ...  However, depending on the desired non-determinism, there are different options of interaction between the existing and the additional structure.  ...  ACKNOWLEDGMENT The authors are grateful to the members of IFIP WG 2.1 for preliminary discussions about the topic of this paper.  ... 
doi:10.1016/j.entcs.2018.06.008 fatcat:zwzjfx34srg75opljznr3gxfui
« Previous Showing results 1 — 15 out of 166,655 results