Jeffrey D. Ullman. Elements of ML Programming. Prentice Hall, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....several systems, such as the NORAD command center and an electronic funds transfer system. As opposed to P T nets, where all tokens are of Boolean type, CP net tokens can be of arbitrary color (type) and complexity. Because CP net notations are based on a functional programming language SML [29], arc expressions allow concise specification of complex token manipulations. To support modularity, CP nets provide such features 3 as substitution transitions and fusion places. Substitution transitions, a notational convenience designed to allow modular representation of large and complex ....

 J. Ullman, Elements of ML Programming. Prentice Hall, 1994.

....in further refinements. The 4 type of the abstract token is declared with the prefix complex . This type is decomposed into several subtypes(primitive types) of tokens in refined nets. The definition of Data Dictionary is very straightforward, and is written in a textual grammar such as CPN ML[18]. The graphical representation of the HOONet is shown in Figure 1. ION partial structure of internal behaviors Data Dictionary LEGENDS Pi Ta Ti Tc Figure 1: General notations to represent HOONet In Figure 1, with a marking at OIP and OIP:status = pre , a firing transition from ....

Ullman, J.D.: 'Elements of ML Programming, ML97 Edition', (Prentice-Hall, New Jersey, 1998)

....distributed objects based on the modified CCU algorithm. We begin with a summary of the implementation language, Concurrent ML, and then describe the details of the implementation. 4.1 Summary of Concurrent ML Concurrent ML (CML) was designed by John Reppy[17] in 1990. It is an extension of SML[14, 22] that allows for concurrent programming and is included in the more recent distributions of Standard ML of New Jersey (SML NJ) CML was written entirely in ML, without any modifications to the compiler. Because SML NJ is internally represented using continuation passing style[1] and provides ....

Je#rey D. Ullman. Elements of ML Programming. Prentice Hall, Upper Saddle River, New Jersey, ML97 edition, 1998.

....and it yields orders of magnitude improvements both in time and in space for type isomorphisms. 1 Introduction 1.1 Background: reduction based vs. reduction free normalization Say that we consider binary trees modulo associativity. Binary trees are easily coded as a data type in Standard ML [36, 37, 45]: datatype a bt = LEAF of a NODE of a bt a bt (In this declaration, bt is the name of the data type. It is parameterized with a type variable a to express that the data type is polymorphic: we can represent Basic Research in Computer Science (www.brics.dk) funded by the Danish ....

Je#rey D. Ullman. Elements of ML Programming (ML 97 edition). Prentice-Hall, 1998.

....program. The use of programming languages that provide type safety, pattern matching, and automatic storage management can reduce the compiler s code size and eliminate some common kinds of errors. However, many programming languages that appear well suited for compiler implementation, like ML [19], still do not address other issues, such as substitution and preservation of scoping in the compiled program. In this paper, we present an alternative approach, based on the use of higher order abstract syntax [15, 16] and term rewriting in a general purpose logical framework. All program ....

....to machine code. The reason for the intermediate representation is that many of the transformations in the compiler can be stated abstractly, independent of the source and machine representations. The language that we are using as an example (see Section 2) is a small language similar to ML [19]. To keep the presentation simple, the language is untyped. However, it includes higher order and nested functions, and one necessary step in the compilation process is closure conversion, in which the program is modi ed so that all functions are closed. The high level outline of the paper is as ....

Jerey D. Ullman. Elements of ML Programming. Prentice Hall, 1998.

....Submitted to ICFP 2003, Uppsala, Sweden. provide type safety, pattern matching, and automatic storage management can reduce the compiler s code size and eliminate some common kinds of errors. However, many programming languages that appear well suited for compiler implementation, like ML [19], still do not address other issues, such as substitution and preservation of scoping in the compiled program. In this paper, we present an alternative approach, based on the use of higher order abstract syntax [15, 16] and term rewriting in a general purpose logical framework. All program ....

....to machine code. The reason for the intermediate representation is that many of the transformations in the compiler can be stated abstractly, independent of the source and machine representations. The language that we are using as an example (see Section 2) is a small language similar to ML [19]. To keep the presentation simple, the language is untyped. However, it includes higher order and nested functions, and one necessary step in the compilation process is closure conversion, in which the program is modi ed so that all functions are closed. The high level outline of the paper is as ....

J. D. Ullman. Elements of ML Programming. Prentice Hall, 1998.

....and analysis of AMS using CPnets [15, 16] Coloured Petri Nets [12, 13] are a graphically oriented modelling language for the design, specification, and verification of concurrent and distributed systems. CPNs are based on Petri Nets and the functional programming language Standard ML (SML) [17]. Petri Nets provide the primitives for modelling concurrency and synchronization, whereas SML provides the primitives for modelling data manipulation in systems and for creating compact and parameterisable CPN models. A CPN model of a system describes the states that the system may be in and the ....

....of the corresponding device. Arcs connect transitions and places on a CPN model. These arcs have arc inscriptions describing the tokens removed from and added to places upon the occurrence of enabled transitions. Arc inscriptions are written in the functional programming language Standard ML (SML) [17]. 4.3 The Data Management System Model The DMS most abstract level is modelled by page DMS#3 depicted in Figure 7. It is the sub page associated with the Data Management System substitution transition in Figure 6. The DMS#3 page contains two substitution transitions: EGPC1 and the 1553 I O ....

Ullman, J., 1998, Elements of ML Programming, Prentice-Hall, NJ.

....respect to progress measure) of the state space will result, ensuring that the number of states that can be deleted is maximised. 5 Sweep Line Exploration of the Stop and Wait Protocol The Sweep CPN library supports progress measures based on total orderings, and consists of a set of Standard ML [19] les which can be loaded into the Design CPN state space tool [1] Currently there is no graphical user interface (GUI) support associated with Sweep CPN, and all interaction with the library is via evaluation of auxiliary boxes containing SML code. The GUI of the Design CPN state space tool can ....

....state space exploration functions presented in Sect. 6. The structure of Sweep CPN (i.e. as a set of query functions) has been inspired by the structure of the existing state space exploration tool, which was in turn partially inspired by functional programming concepts such as mapping and folding [19]. The standard dynamic properties of CP nets are informally introduced throughout this section. The reader interested in the full and formal de nition of the standard dynamic properties of CP nets is referred to [12] 7.1 Reachability Properties A marking is said to be reachable, if it is ....

J.D. Ullman. Elements of ML Programming. Prentice-Hall, 1998.

.... work [9, 10, 14] Visualization in assisting the use of recursion through software and web based tools can help students learn and understand recursion [7, 16] Previous interactive systems for teaching recursion include [1, 3, 7] In this paper we describe how we use SML (Standard Meta Language) [15] to teach functions and recursion in the Discrete Structures course at the State University of New York at Stony Brook. Because of an unusual ordering of courses at Stony Brook, Discrete Structures is the rst course taken by students who want to enter the Computer Science or Information Science ....

J. Ullman. Elements of ML Programming. Prentice Hall, 1998.

.... modelled using Coloured Petri Nets (CP nets or CPNs) 13, 19] The prototype has been implemented on top of the Design CPN state space tool [4] and is a further development of the prototype for the basic sweep line method reported on in [5] In the prototype implementation, the Standard ML (SML) [23] programming language is available to the user for specifying progress measures. The user provides a progress mapping to the tool by writing an SML function mapping a state into an integer. SML support for unbounded integers is exploited as the co domain for progress mappings. The ordering on ....

J.D. Ullman. Elements of ML Programming. Prentice-Hall, 1998.

....A evaluates to Division By Zero and B evaluates to Type Error. If C propagated only one of the exceptions (as is true in other spreadsheet languages) it would not return the same answer as it would if its formula were the mathematically equivalent B A The functional languages ALEX [2] and ML [21, 57] define this problem away by proposing left to right semantics. This is also the solution used in Excel. However, this restriction is not particularly compatible with parallel execution or with the dynamic execution scheduling common in spreadsheet languages. In Gerald [43] exceptions are given ....

J. Ullman, Elements of ML Programming, Prentice Hall, 1998.

....space exploration. 9 Implementing the Progress Measure In this section we show how the progress measure WTP in the previous section can be implemented and provided as input to the sweep line library [6] The sweep line library is implemented on top of Design CPN [7] and the Standard ML (SML) [17] programming language is available to the user for specifying progress measures. The user provides a progress measure to the tool by writing an SML function mapping a marking into an integer. SML support for unbounded integers (integers which cannot over ow) is exploited as the co domain for ....

J. D. Ullman. Elements of ML Programming. Prentice Hall, Englewood Clis, NJ, 2nd edition, 1998.

No context found.

Jeffrey D. Ullman. Elements of ML Programming. Prentice Hall, 1994.

No context found.

Je#rey D. Ullman. Elements of ML Programming. Prentice-Hall, 1993.

No context found.

Jerey D. Ullman. Elements of ML Programming. Prentice Hall, 1998.

No context found.

Je#rey D. Ullman. Elements of ML Programming. Prentice Hall, 1998.

No context found.

J.D. Ullman. Elements of ML Programming. Prentice-Hall, 1998.

No context found.

J.D. Ullman. Elements of ML Programming. Prentice-Hall, 1998.

No context found.

J. D. Ullman. Elements of ML Programming. Prentice Hall, 1998.

No context found.

Ullman, J.D.: Elements of ML Programming. Prentice-Hall, 1997

No context found.

J.D. Ullman, Elements of ML Programming, Prentice-Hall 1994

No context found.

J.D. Ullman, Elements of ML Programming, Prentice-Hall Inc., 1998 32

No context found.

J. Ullman, Elements of ML Programming, Prentice-Hall Inc., 1998

No context found.

Jeffrey D. Ullman. Elements of ML Programming. Prentice Hall, Englewood Cliffs, NJ, 1994.

No context found.

J. D. Ullman, Elements of ML Programming, Prentice-Hall, 1994.

First 50 documents  Next 50

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