Filters








66,379 Hits in 4.8 sec

An Algebraic Characterization of Data and Timed Languages [chapter]

Patricia Bouyer, Antoine Petit, Denis Thérien
2001 Lecture Notes in Computer Science  
doi:10.1007/3-540-44685-0_17 fatcat:agmbgxbzbzh2jifyqotz5t6aye

Page 3890 of Mathematical Reviews Vol. , Issue 97F [page]

1997 Mathematical Reviews  
Nivat and Podelski and by Steinby to characterize classes of regular tree languages.  ...  Iskander (1-SWLA; Lafayette, LA) 971:68134 68Q70 08A70 68Q45 68Q68 Wilke, Thomas (D-KIEL-I; Kiel) An algebraic characterization of frontier testable tree languages.  ... 

Page 29 of The Cornell Engineer Vol. 33, Issue 1 [page]

1967 The Cornell Engineer  
Ex- amples are COBOL, a business oriented language; FORTRAN, an algebraic, scientific language; CUPL, an algebraic, teaching lang- uage; and assembly language, which is machine oriented.  ...  Second generation opeting sys- tems were characterized by batch process loading. The computer could only operate with certain languages at certain times and could only perform one job at a time.  ... 

Page 5898 of Mathematical Reviews Vol. , Issue 87j [page]

1987 Mathematical Reviews  
We show here that a subset of this language, without an explicit negation operator, also characterizes it.  ...  Summary: “The concept of algebraic types is adapted to allow axiomatic characterizations of ordered and continuous algebras; infinite objects are then limit points in the carriers of certain con- tinuous  ... 

Page 4183 of Mathematical Reviews Vol. , Issue 2001F [page]

2001 Mathematical Reviews  
An applicative process algebra, obtained by embedding the Linda primitives for communication in a CCS/CSP-like language, and an imperative one, obtained from the applicative variant by adding a construct  ...  The basic idea of process algebras is that distributed systems may be modeled as sets of concurrent communicating processes, and the main aim is that of providing both description languages and techniques  ... 

Page 4247 of Mathematical Reviews Vol. , Issue 81J [page]

1981 Mathematical Reviews  
The set of finite 2-trees is denoted by T; and the following kten | of languages generated by type 3 time-varying grammars such that continuous algebra A, is defined.  ...  An R-subsemimodule A Datenverarbeitung [Reports of the Society for Mathematics and ivation} of R((M)» is termed invariant if, for each m in M, s is in A Data Processing], 119. ralized implies r,,s is in  ... 

Page 1065 of Mathematical Reviews Vol. , Issue 91B [page]

1991 Mathematical Reviews  
A state in the execu- tion of a program is viewed as an algebra, the state transformation corresponding to a declaration changes the algebra and its pre- sentation.  ...  We provide a uniform treatment of the declarations of constants, aliases, variables, data types, and pointers, in terms of transformations defined using pushouts and reducts of algebras.”  ... 

Page 4578 of Mathematical Reviews Vol. , Issue 98G [page]

1998 Mathematical Reviews  
An algebraic framework allowing specification of both “classical” (or “static”) and “dynamic” data types is presented. The latter can model concurrent/parallel/reactive processes/systems.  ...  However, in contrast to process algebras we work with a concrete representation (a mathematical system model) of specifications and use algebraic equations to specify components and not programming languages  ... 

Page 4461 of Mathematical Reviews Vol. , Issue 82j [page]

1982 Mathematical Reviews  
We explain the capabilities and make an analysis and comparison of languages of four classes: relational algebra, languages of the relational calculus, languages oriented towards mapping and, tabular languages  ...  AGG T equations, in the framework of continuous algebras. A system E of CF equations is defined as a mapping from a set into an w-continuous algebra of a certain type.  ... 

SOME OF MY FAVOURITE RESULTS IN CLASSIC PROCESS ALGEBRA [chapter]

LUCA ACETO
2004 Current Trends in Theoretical Computer Science  
I thank all of my co-authors and colleagues who have taught me the little I know about this fascinating field of research.  ...  Jos Baeten, Wan Fokkink and Jiří Srba offered incisive comments on previous drafts of this paper. The opinions expressed in this note, and any infelicity herein, are solely my responsibility.  ...  by my (lack of) knowledge, energy and time.  ... 
doi:10.1142/9789812562494_0053 fatcat:l3uurdv3nrbthb4sauro5jau2a

Page 3622 of Mathematical Reviews Vol. , Issue 2000e [page]

2000 Mathematical Reviews  
Hopefully, it will help to convey the view that coalgebraic data types should form an intrinsic part of (future) languages for programming and reasoning.  ...  2000e:68112 sequences form an algebraic complete partial order.  ... 

Book announcements

1984 Discrete Applied Mathematics  
Rosenberg: Repetitions in homomorphisms and languages. H. Ehring and H.-J. Kreowski: Parameter passing commutes with implementation of parameterized data types. A.A.  ...  Krevner and A. Yehudai: An iteration theorem for simple precedence languages. A. Lingas: The power of non-rectilinear holes. D. Niwinski: Fixed-point semantics for algebraic (tree) grammars. D.  ... 
doi:10.1016/0166-218x(84)90070-2 fatcat:75txrigmzzaw5ef5itdxwfbdea

Page 464 of Mathematical Reviews Vol. , Issue 88a [page]

1988 Mathematical Reviews  
bases and denotational semantics of languages.  ...  It is shown that such an algebra is a Hilbert algebra and can be represented by a Hilbert algebra of sets. {Reviewer’s remark: The significance of the results is not made clear.} W. W.  ... 

Page 9238 of Mathematical Reviews Vol. , Issue 2001M [page]

2001 Mathematical Reviews  
In the standard relational model for databases, one models data tables as first-order relations, and expresses data manipulations (in particular, database queries) in the relational algebra (an op- erational  ...  Unlike the fixpoint extension of the flat relational algebra, a naive fixpoint extension of the nested relational algebra does not stay within polynomial space, let alone time.  ... 

Page 2883 of Mathematical Reviews Vol. , Issue 2003d [page]

2003 Mathematical Reviews  
(3-MGL-C; Montreal, QC) An algebraic characterization of data and timed languages.  ...  Summary: “Algebra offers an elegant and powerful approach to understanding regular languages and finite automata. Such a framework has been notoriously lacking for timed languages and timed automata.  ... 
« Previous Showing results 1 — 15 out of 66,379 results