Abstract The development of Coloured Petri Nets (CP-nets or CPN) has been driven by the
desire to develop a modelling language-at the same time theoretically well-founded and …

A comprehensive introduction to type systems and programming languages. A type system
is a syntactic method for automatically checking the absence of certain erroneous behaviors …

Dynamic properties characterize the behaviour of individual CP-nets, eg, whether it is
possible to reach a marking in which no step is enabled. It is often rather difficult to verify …

Standard ML is a general-purpose programming language designed for large projects. This
book provides a formal definition of Standard ML for the benefit of all concerned with the …

This text is based on the chapter Domain Theory in the Handbook for Logic in Computer
Science, volume 3, edited by S. Abramsky, Dov M. Gabbay, and TS E. Maibaum, published …

We present a new approach to proving type soundness for Hindley/Milner-style polymorphic
type systems. The keys to our approach are (1) an adaptation of subject reduction theorems …

T $'e describe a refinement of ML's type system allowing the specification of recursively
defined subtypes of user-defined datatypes. The resulting system of rejirzemeni f, ypes …

We present an approach to enriching the type system of ML with a restricted form of
dependent types, where type index objects are drawn from a constraint domain C, leading to …

The new edition of this successful and established textbook retains its two original intentions
of explaining how to program in the ML language, and teaching the fundamentals of …

This paper presents the basic theoretical aspects of Coloured Petri Nets (CP-nets or CPN).
CP-nets have been developed, from being a promising theoretical model, to being a full …