36,888 Hits in 5.7 sec

Partially-static data as free extension of algebras

Jeremy Yallop, Tamara von Glehn, Ohad Kammar
2018 Proceedings of the ACM on Programming Languages  
We present a foundational view of partially-static data structures as free extensions of algebras for suitable equational theories, i.e. the coproduct of an algebra and a free algebra in the category of  ...  By precalculating these free extensions, we construct a high-level library of partially-static data representations for common algebraic structures.  ...  Supported by the European Research Council grant 'events causality and symmetry Ð the nextgeneration semantics', the Engineering and Physical Sciences Research Council grant EP/N007387/1 'Quantum computation as  ... 
doi:10.1145/3236795 dblp:journals/pacmpl/YallopGK18 fatcat:7vn5psxxivbvdiflr4otzd7sly

Page 3763 of Mathematical Reviews Vol. , Issue 86h [page]

1986 Mathematical Reviews  
structures in which atoms are interpreted as partial functions. 86h:68105 The main results of the paper are as follows.  ...  Part I of this paper deals with basic properties of these algebras, and the existence of free algebras in particular.”  ... 

The Common Framework Initiative for Algebraic Specification and Development of Software [chapter]

Donald Sannella
2000 Lecture Notes in Computer Science  
The central element of the Common Framework is a specification language called Casl for formal specification of functional requirements and modular software design which subsumes many previous algebraic  ...  The Common Framework Initiative ( CoFI ) is an open international collaboration which aims to provide a common framework for algebraic specification and development of software.  ...  Acknowledgements Many thanks to all the participants of CoFI, and in particular to the coordinators of the various CoFI Task Groups: Bernd Krieg-Brückner (Language Design); Andrzej Tarlecki (Semantics)  ... 
doi:10.1007/3-540-46562-6_1 fatcat:eigcvszbr5hutlkl454ao5q5yu

Communicating evolving algebras [chapter]

Paola Glavan, Dean Rosenzweig
1993 Lecture Notes in Computer Science  
As a basic tool we introduce a'modal' logic of transition rules and runs, which is, in the context of evolving algebras, just a de nitional extension of ordinary rst order logic.  ...  Proof by induction over , simultaneously for all static algebras (i.e. passing to A , we apply the inductive hypothesis both to A and to A ). De nition 1.2.5. A ?! A whenever A j = h i.  ...  A static algebra of A is any algebra of (A), i.e. a pair (U; I) where U is a set and I is a partial interpretation of (A) in U.  ... 
doi:10.1007/3-540-56992-8_13 fatcat:qqz6m72povdhphksfomebpkc44

Errors as Data Values

Tero Hasu, Magne Haveraaen
2016 Norsk Informatikkonferanse  
A "thrown" exception is a non-local side effect that complicates static reasoning about code. Particularly in functional languages it is fairly common to instead propagate errors as ordinary values.  ...  It furthermore supports automatically checking data invariants and function pre-and post-conditions, recording a trace of any due-to-an-error unevaluateable or failed expressions, and in some cases retaining  ...  Acknowledgments This research has been supported by the Research Council of Norway through the project DMPL-Design of a Mouldable Programming Language.  ... 
dblp:conf/nik/HasuH16 fatcat:gebvmyfhvbgf3gt3fowwgrfiju

Page 2260 of Mathematical Reviews Vol. , Issue 94d [page]

1994 Mathematical Reviews  
These include data structures, algebraic modules, rewriting and computing, canonical forms, tools for buiiding strategies and data types.”  ...  A (simple) loop check L is defined as a computable set L of finite SLD-derivations such that L is closed under variants and subderivation free.  ... 

From static to dynamic abstract data-types: an institution transformation

Elena Zucca
1999 Theoretical Computer Science  
state can be viewed as a static data type in the underlying formalism, and the dynamic evolution is given by operations handling configurations.  ...  We show how to extend in a canonical way a given formalism for specifying (static) data types (like usual algebraic specification frameworks) with dynamic features.  ...  helpful comments and suggestions on a preliminary presentation of this work.  ... 
doi:10.1016/s0304-3975(98)00125-x fatcat:2xrc5abvvrhhpailo4groq2t5q

Page 3536 of Mathematical Reviews Vol. , Issue 82h [page]

1982 Mathematical Reviews  
In the algebraic theory as introduced by the ADJ-group, a parameterized specification, like set (data), consists of a parameter declaration data and a target specification set (data).  ...  We show that the hypergraph formalism is a uniform notation to represent data and properties of data. Several results concerning context-free generation of conceptual schemata are proved.”  ... 

CASL: the Common Algebraic Specification Language

Egidio Astesiano, Michel Bidoit, Hélène Kirchner, Bernd Krieg-Brückner, Peter D. Mosses, Donald Sannella, Andrzej Tarlecki
2002 Theoretical Computer Science  
Some familiarity with the fundamental concepts of algebraic speciÿcation would be advantageous.  ...  The Common Algebraic Speciÿcation Language (CASL) is an expressive language for the formal speciÿcation of functional requirements and modular design of software.  ...  Acknowledgements This paper has been written by the coordinators of the CoFI Working Group. We  ... 
doi:10.1016/s0304-3975(01)00368-1 fatcat:w6rcgk5xwjgf7nzlcyhqrcf2gu

Dynamic Systems with Implicit State [chapter]

Marie-Claude Gaudel, Carole Khoury, Alexandre Zamulin
1999 Lecture Notes in Computer Science  
In this approach a dynamic system is defined as some algebras representing the system's state, a set of access functions permitting to observe the state and a set of modifiers permitting to change the  ...  This paper presents a formalism of algebraic specifications with implicit state based on the concept of dynamic system.  ...  Acknowledgement We warmly thank Pierre Dauchy for his numerous and important contributions to AS-IS.  ... 
doi:10.1007/978-3-540-49020-3_8 fatcat:mava3gfmrvazbc7t4fdenpsbky

Full abstraction and limiting completeness in equational languages

Satish R. Thatte
1989 Theoretical Computer Science  
If this thesis is accepted, the appropriateness of the corresponding definition of approximant can be seen as a design principle to test the mutual suitability of the parameters defining a language.  ...  The former is used to prove limiting completeness for the language of regular .~~xtem.s [5] which includes as subsets and restrictions the equational parts of many other languages.  ...  Acknowledgment I am indebted to Lawrence Moss for suggesting the idea that language models form a category to which the usual notions of initiality and finality can be "lifted".  ... 
doi:10.1016/0304-3975(89)90139-4 fatcat:n5douxgeyrc2zf6lop3hpp3vjq

Page 2772 of Mathematical Reviews Vol. , Issue 2002D [page]

2002 Mathematical Reviews  
and mixed algebras (263-285); Artur Wolinski, Cylindric algebras for partial relational systems.  ...  Pavlides, Generalized radial-basis function neural networks for data mining of symbolic data (79- 85); A. P. Engelbrecht, Data generation using sensitivity analysis (86-91); Lotfi A.  ... 

Staged generic programming

Jeremy Yallop
2017 Proceedings of the ACM on Programming Languages  
Generic programming libraries such as Scrap Your Boilerplate eliminate the need to write repetitive code, but typically introduce significant performance overheads.  ...  Partially-static data and algebraic structure. benefit from partially-static data designed to take advantage of the algebraic laws of the underlying structure: as with partially-static lists, the string  ...  as partially static.  ... 
doi:10.1145/3110273 dblp:journals/pacmpl/Yallop17 fatcat:23a3xf5a7nc3ribcrvfnnkeeai

Optimizing modular logic languages

Michele Bugliesi, Anna Ciampolini, Evelina Lamma, Paola Mello
1998 ACM Computing Surveys  
The first, more effective for languages with static scope rules, is based on the application of partial evaluation (partial deduction in this context [Komorowski 1981] ).  ...  ., 1515 Broadway, New York, NY 10036 USA, fax +1 (212) 869-0481, or viewed as independent sub-programs, interpreted as elements of an algebra, and module composition is rendered in  ... 
doi:10.1145/289121.289131 fatcat:blxpajjd3nelbjbphypl7paqm4

Optimization of dynamic query evaluation plans

Richard L. Cole, Goetz Graefe
1994 Proceedings of the 1994 ACM SIGMOD international conference on Management of data - SIGMOD '94  
Traditional query optimizers assume accurate knowledge of run-  ...  Since the objective of this research is optimization of dynamic plans, not data modeling or extensible query processing models, the algebras in this prototype define a basic relational data model and typical  ...  Extensibility and Generality of Approach Let us presume that a query optimizer encapsulates cost in an abstract data type, as is done in the Volcano optimizer generator as well as many other optimizers  ... 
doi:10.1145/191839.191872 dblp:conf/sigmod/ColeG94 fatcat:f7q7hlleerhcfez4ryzipddnny
« Previous Showing results 1 — 15 out of 36,888 results