The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.

## Filters

##
###
Page 5653 of Mathematical Reviews Vol. , Issue 91J
[page]

1991
*
Mathematical Reviews
*

Summary: “We present a

*logical*framework*for**constructing*a pro- gramming language in which one*programs*by proofs, in order to ensure*program*correctness. ... The shortcomings of the two approaches include inadequate*program*derivation techniques*for*formal methods and poor specification facilities in*constructive*theories. ...##
###
Page 3763 of Mathematical Reviews Vol. , Issue 86h
[page]

1986
*
Mathematical Reviews
*

{

*For*the entire collection see MR 85m:68002.} Germano, G. (I-PISA); Mazzanti, S. (I-PISA) 86h:68108 Partial closures and semantics of while:*towards**an*iteration-based theory of data types. ...*For**an*arbitrary*program*P, loop(P) is a formula valid in a given state s if and only if there exists a computation of P that starts and ends at s. ...##
###
Page 1052 of Mathematical Reviews Vol. , Issue 91B
[page]

1991
*
Mathematical Reviews
*

Warren, HiLog: a first-order semantics

*for*higher- order*logic**programming**constructs*(pp. 1090-1114); Changwoo Pyo and Uday S. ... Elcock, Absys: the historical inevitability of*logic**programming*(pp. 1201-1214); Jack Minker,*Toward*a foundation of disjunctive*logic**programming*(pp. 1215-1235). ...##
###
Page 3598 of Mathematical Reviews Vol. , Issue 90F
[page]

1990
*
Mathematical Reviews
*

Summary: “Assertional categories provide a general

*algebraic*framework*for*the denotation of*programs*. ... Jan Sturc (Bratislava) 90f:68113 68Q55 68N05 68Q65 Sannella, Donald (4-EDIN-A); Tarlecki, Andrzej (PL-PAN-C)*Toward*formal development of*programs*from*algebraic*specifications: implementations revisited ...##
###
Overview of Algebraic Specification Languages, Environments and Tools, and Algebraic Specifications of Software Systems
[chapter]

1993
*
Current Trends in Theoretical Computer Science
*

New Concepts

doi:10.1142/9789812794499_0005
dblp:series/wsscs/EhrigC93
fatcat:bxuegusoh5c6ll3syeflokcxbu
*for*Amalgamation and Extension in the Framework of Specification*Logics*p. 161*Towards*the*Algebraic*Specification of Classes in Object Oriented*Programming*p. 183 Restriction*Constructions*... in Specification*Logics*p. 195*Towards**an**Algebraic*Specification Framework*for*the VLSI Design Process p. 202 In the Prehistory of Formal Language Theory: Gauss Languages p. 551 What Emil Said About ...##
###
Page 3203 of Mathematical Reviews Vol. , Issue 88f
[page]

1988
*
Mathematical Reviews
*

This paper is a step

*towards*a practical framework*for*the formal stepwise development of modular*programs*from abstract spec- ifications. ... Dynamic*logic*has been introduced as a formal system*for*reason- ing about properties of*programs*[cf. D. Harel, First-order dynamic*logic*, Lecture Notes in Comput. ...##
###
Page 2260 of Mathematical Reviews Vol. , Issue 94d
[page]

1994
*
Mathematical Reviews
*

Summary: “

*An**algebraic**programming*system (APS) integrates four main paradigms of computations: procedural, functional,*algebraic*(rewriting rules) and*logical*. ... {*For*the entire collection see MR 94d:68010.} 944:68020 68N05 Moller, Bernhard (D-AGSB; Augsburg)*Towards*pointer*algebra*. (English summary) Sci. Comput.*Programming*21 (1993), no. 1, 57-90. ...##
###
Introduction
[chapter]

1993
*
Lecture Notes in Computer Science
*

Summaries of the Contributions in this Book BACKHOUSE/HOOGENDIJK's paper introduces

doi:10.1007/3-540-57499-9_14
fatcat:eztaayoch5crzf76amxx6q7r3i
*an**algebra*of data types oriented*towards*the calculation of polymorphic/unctions and relations. ... MOLLER introduces some operators and laws of*an**algebra*of formal languages, a subalgebra of which corresponds to the*algebra*of multiary relations. Central operations ... PEPPER's contribution models the*programming*activity as a deduction in a formal calculus*for**program*development based on concepts from*algebra*and*logic*. ...##
###
Page 6652 of Mathematical Reviews Vol. , Issue 90K
[page]

1990
*
Mathematical Reviews
*

*For*instance, in Section 7.2.3 the internal

*logic*in a topos is

*programmed*in ML and then this

*program*is applied on

*an*example topos to produce the truth-tables of a three-valued

*logic*. ... Accordingly, the theorem that if a category has

*an*initial object and pushouts then it has all finite colimits yields

*an*iterative algorithm

*for*

*constructing*the colimit- ing cocone of a finite diagram ...

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

2002
*
Mathematical Reviews
*

Haeberer, A calculus

*for**program**construction*based on fork*algebras*, design strategies and generic algorithms (37-58); Michael Winter and Peter Kempf, Processes as relations (59-73); Wendy MacCaull, A ... dynamic*logic**programming*(469-486). ...##
###
Mathematical theory of multiprocessor control systems and its applications

1995
*
Computer Science Journal of Moldova
*

The model functioning can be formalized by the technique of systems of algorithmic

doaj:e35a280ea84640df8b8adefcad2498ba
fatcat:57ovnnvulfbt7mb7yo76efzsya
*algebras*(SAA). ... The abstract model of such*an*interaction may be based on the control and operating automata composition originating in the abstract computer model suggested by V.M.Glushkov [1]. ... in the SAA A, B by*an*equivalent regular scheme: a*constructive*procedure of regularization (reduction to the regular scheme) is developed*for*arbitrary algorithms and*programs*. ...##
###
Page 3879 of Mathematical Reviews Vol. , Issue 81J
[page]

1981
*
Mathematical Reviews
*

The author gives

*an**algebraic*criterion*for*equivalence of two periodic abelian groups in*program**logic*. Here he uses ideas of J. Barwise and P. Eklof [Ann. Math. ...*Program**logic*is*an*extension of first-order*logic*L, but is weaker than L,,.,. The concept of a formula of*program**logic*is based on the concept of a*program*. ...##
###
Page 1182 of Mathematical Reviews Vol. , Issue 97B
[page]

1997
*
Mathematical Reviews
*

Apt, Arrays, bounded quantification and iteration in

*logic*and constraint*logic**programming*(133-148); Anne Kaldewaij and Victor J. ... Desharnais, A relational calculus*for**program**construction*by parts (237-254); Ketil Stolen, Refinement principles supporting the transition from asynchronous unbounded to synchronous communication (255 ...##
###
Page 7646 of Mathematical Reviews Vol. , Issue 95m
[page]

1995
*
Mathematical Reviews
*

(1-CA3-C; Irvine, CA) Propositional semantics

*for*disjunctive*logic**programs*. ... They consider a*logic**program*proof tree as a parse tree of some grammar and try to extend results and methods established*for*grammars to*logic**programs*. The book consists of 8 chapters. ...##
###
Page 2666 of Mathematical Reviews Vol. , Issue 86f
[page]

1986
*
Mathematical Reviews
*

Hibbard, Applicative state transition systems in LISP-like notation (pp. 51- 66); Walter Dosch and Bernhard Moller,

*An**algebraic*semantics*for*Backus’ functional*programming*language with infinite objects ... Michael Moller, The computation of the Hilbert func- tion (pp. 157-167); Franz Winkler,*An*algorithm*for**constructing*detaching bases in the ring of polynomials over a field (pp. 168- 179); Horst G. ...
« Previous

*Showing results 1 — 15 out of 47,059 results*