| David Rydeheard and Rod Burstall. Computational Category Theory (Prentice Hall International Series in Computer Science). Prentice Hall, 1988. |
....by Iowa State University. This document s distributed under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. Department of Computer Science 226 Atanasoff Hall Iowa State University Ames, Iowa 50011 1040, USA Preliminary Design of JML: A Behavioral Interface Specification Language for Java Gary T. Leavens , Albert L. Baker, and Clyde Ruby Department of Computer Science, 226 Atanasoff Hall Iowa State University, Ames, Iowa 50011 1040 USA leavens cs.iastate.edu, baker cs.istate.edu, ....
....226 Atanasoff Hall Iowa State University Ames, Iowa 50011 1040, USA Preliminary Design of JML: A Behavioral Interface Specification Language for Java Gary T. Leavens , Albert L. Baker, and Clyde Ruby Department of Computer Science, 226 Atanasoff Hall Iowa State University, Ames, Iowa 50011 1040 USA leavens cs.iastate.edu, baker cs.istate.edu, ruby cs.iastate.edu July 2, 1999 Abstract JML is a behavioral interface specification language tailored to Java. It also allows assertions to be intermixed with Java code, as an aid to verification and debugging. JML is designed to be ....
[Article contains additional citation context not shown here]
David A. Watt. Programming Language Syntax and Semantics. Prentice Hall International Series in Computer Science. Prentice-Hall, New York, N.Y., 1991.
.... is almost ready for distribution and will be available in the web site of the RAT Project [Rat] The main motivation for the definition of this method was support a of compiler generation method, defined in [Men98] that produces automatic implementations of action semantics descriptions [Mos92, Wat91] to improve the systems that use fixed implementations. ....
D. A. Watt. Programming Language Syntax and Semantics. Prentice Hall International Series in Computer Science. Prentice Hall, 1991. This article was processed using the L A T E X macro package with LLNCS style
....S 541 Programming Languages 1 March 17, 1997 Grammar for the elp Interpreter for Prolog The following grammar for Prolog is adapted from the files elp.grm and elp.lex in release 0.1x of elp, obtained from Amy Felty. It uses the notation of [Wat91, Chapter 2]. This grammar is ambiguous, and disambiguations are indicated by comments in the grammar following a percent sign ( 1 Macrosyntax Files follow the grammar for File below. The interpreter evaluates Terms from the grammar below. File : Module j Module File Module : Module Decl ....
.... j Type Appl Type Atom Type Atom : o j int j string j char j lcid j Upper Case Id j ( Type Expr ) Kind Expr : type j Kind Expr Kind Expr 2 Microsyntax The microsyntax tells how tokens are formed, and explicitly treats each character (i.e. the tokens of the grammar below are characters [Wat91]) File : Token j Comment j Blank) Token : lower case id j Quoted Id j Upper Case Id j Int Literal jString Literal j Keyword j . j ( j ) j : j , j ; j = j : j j j : j = Keyword : module j import j type j kind j infixl j infixr j infix j prefix j postfix j int j string j char ....
David A. Watt. Programming Language Syntax and Semantics. Prentice Hall International Series in Computer Science. Prentice-Hall, New York, N.Y., 1991. 3
....3.1 as n bxc j U:n x . 3.3) A similar rewriting can be done for definition 3.2. As long as we note that n is an integer, we can safely omit the U . It has already been noted that the specifications of floor and ceiling can be given in the shape of a Galois connection, see [GKP89] and [RB88] But that fact is not used in any calculation. Even worse, in [GKP89] they don t consider it useful at all to recognise a Galois connection since they have difficulty remembering the Galois connection In order to show the usefulness of the given Galois connection, let s calculate some ....
David E. Rydeheard and Rod M. Burstall. Computational Category Theory. Prentice Hall International Series in Computer Science. Prentice Hall, first edition, 1988.
....not tokens. Another way of thinking of this is that no white space may intervene between the characters of a token. The microsyntax of JML is described by the production microsyntax in the grammar below. It describes what a program looks like from the point of view of a lexical analyzer [Watt91]. The nonterminal java literal represents Java literals which are taken without change from Java [Gosling Joy Steele96] microsyntax : lexeme [ lexeme ] lexeme : white space comment annotation marker doc comment token token : ident keyword special symbol java literal ....
David A. Watt. Programming Language Syntax and Semantics. Prentice Hall International Series in Computer Science. Prentice-Hall, New York, N.Y., 1991.
....S 541 Programming Languages 1 March 17, 1997 Grammar for the elp Interpreter for Prolog The following grammar for Prolog is adapted from the files elp.grm and elp.lex in release 0.1x of elp, obtained from Amy Felty. It uses the notation of [Wat91, Chapter 2]. This grammar is ambiguous, and disambiguations are indicated by comments in the grammar following a percent sign ( 1 Macrosyntax Files follow the grammar for File below. The interpreter evaluates Terms from the grammar below. File : Module j Module File Module : Module Decl ....
.... j Type Appl Type Atom Type Atom : o j int j string j char j lcid j Upper Case Id j ( Type Expr ) Kind Expr : type j Kind Expr Kind Expr 2 Microsyntax The microsyntax tells how tokens are formed, and explicitly treats each character (i.e. the tokens of the grammar below are characters [Wat91]) File : Token j Comment j Blank) Token : lower case id j Quoted Id j Upper Case Id j Int Literal jString Literal j Keyword j . j ( j ) j : j , j ; j = j : j j j : j = Keyword : module j import j type j kind j infixl j infixr j infix j prefix j postfix j int j string j char ....
David A. Watt. Programming Language Syntax and Semantics. Prentice Hall International Series in Computer Science. Prentice-Hall, New York, N.Y., 1991.
....him to transform subclass objects to superclass objects and back. Another way of looking at this comparison is while our work models subtype polymorphism, Wagner s work gives a mathematical explanation for a set of classes with inheritance. Other related work includes action semantics [Mos92] [Wat91], which specify data using algebraic techniques. Action semantics, unlike denotational semantics, is more operational in nature. It would be interesting to look at applying the concepts of actions in our mutation algebras and split semantics. Mason and Talcott [MT91] MT92] studied the semantics ....
David A. Watt. Programming Language Syntax and Semantics. Prentice Hall International Series in Computer Science. Prentice-Hall, New York, N.Y., 1991.
....[A] 10) Like stores, environments are typed mappings. That is, if j : ENV [A] and if x : T 2 dom(j) then j(x) 2 VALS A T . We write emptyEnviron for the empty finite function from identifiers to denotable values, and define the following functions on environments, for any Sigma algebra A [71]. emptyEnviron : ENV [A] I : overlay : ENV [A] Theta ENV [A] ENV [A] overlay(j 1 ; j 2 ) I : if I 2 dom(j 1 ) then j 1 [ I ] else j 2 [ I ] bind : Identifier Theta VALS A ENV [A] bind(I ; v) I 0 : if I 0 = I then v else We also use the notation [I 7 v]j as a ....
David A. Watt. Programming Language Syntax and Semantics. Prentice Hall International Series in Computer Science. Prentice-Hall, New York, N.Y., 1991.
....S 541 Programming Languages 1 March 17, 1997 Grammar for the elp Interpreter for Prolog The following grammar for Prolog is adapted from the files elp.grm and elp.lex in release 0.1x of elp, obtained from Amy Felty. It uses the notation of [Wat91, Chapter 2]. This grammar is ambiguous, and disambiguations are indicated by comments in the grammar following a percent sign ( 1 Macrosyntax Files follow the grammar for File below. The interpreter evaluates Terms from the grammar below. File : Module j Module File Module : Module Decl ....
.... j Type Appl Type Atom Type Atom : o j int j string j char j lcid j Upper Case Id j ( Type Expr ) Kind Expr : type j Kind Expr Kind Expr 2 Microsyntax The microsyntax tells how tokens are formed, and explicitly treats each character (i.e. the tokens of the grammar below are characters [Wat91]) File : Token j Comment j Blank) Token : lower case id j Quoted Id j Upper Case Id j Int Literal jString Literal j Keyword j . j ( j ) j : j , j ; j = j : j j j : j = Keyword : module j import j type j kind j infixl j infixr j infix j prefix j postfix j int j string j char ....
David A. Watt. Programming Language Syntax and Semantics. Prentice Hall International Series in Computer Science. Prentice-Hall, New York, N.Y., 1991.
....there should be absolutely no problems in translating this to another functional language, such as Standard ML or Scheme. 1.3 Category theory This section is not intended as a tutorial on category theory. A number of very readable introductory books on the subject exist, e.g. Arbib Manes 75,Rydeheard Burstall 88] The mathematically inclined reader may prefer [MacLane 71] but this can hardly be recommended as an introduction for the average computer scientist. For the higher order constructs the main reference is [Lambek Scott 86] Unlike many other branches of mathematics, category theory is ....
David E. Rydeheard and Rod M. Burstall: Computational Category Theory. Prentice Hall International Series in Computer Science, Prentice Hall (1988).
....and Verifying and Reasoning about Programs assertions, logics of programs, pre and postconditions, specification techniques. Copyright c fl 1998 by Gary T. Leavens, Albert L. Baker and Clyde Ruby. Department of Computer Science 226 Atanasoff Hall Iowa State University Ames, Iowa 50011 1040, USA Preliminary Design of JML: A Behavioral Interface Specification Language for Java Gary T. Leavens , Albert L. Baker, and Clyde Ruby Department of Computer Science, 226 Atanasoff Hall Iowa State University, Ames, Iowa 50011 1040 USA leavens cs.iastate.edu, baker cs.istate.edu, ....
....226 Atanasoff Hall Iowa State University Ames, Iowa 50011 1040, USA Preliminary Design of JML: A Behavioral Interface Specification Language for Java Gary T. Leavens , Albert L. Baker, and Clyde Ruby Department of Computer Science, 226 Atanasoff Hall Iowa State University, Ames, Iowa 50011 1040 USA leavens cs.iastate.edu, baker cs.istate.edu, ruby cs.iastate.edu January 29, 1999 Abstract JML is a behavioral interface specification language tailored to Java. It also allows assertions to be intermixed with Java code, as an aid to verification and debugging. JML is designed to be used by ....
[Article contains additional citation context not shown here]
David A. Watt. Programming Language Syntax and Semantics. Prentice Hall International Series in Computer Science. Prentice-Hall, New York, N.Y., 1991.
.... yet [8, 9] The authors are developing a formal language, called the product modeling language (PML) that can be used to specify design product models (see figure 1) In keeping with our hypothesis regarding the benefits of strict logical rigor, the authors are employing denotational semantics [10], a formal theory of computation in general, which derives from the calculus (the theory of functions) and set theory. The authors have found that denotational semantics can be enhanced for our purposes in the same way as set theory was enhanced to produce HM while maintaining continuity of ....
David A. Watt. Programming Language Syntax and Semantics. Prentice Hall International Series in Computer Science. Prentice Hall Inc., New York, 1991.
No context found.
David Rydeheard and Rod Burstall. Computational Category Theory (Prentice Hall International Series in Computer Science). Prentice Hall, 1988.
No context found.
D.A. Watt, programming language Syntax and Semantics, Prentice Hall International Series in Computer Science, Prentice Hall, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC