Let Q_0 denote the rational numbers expanded to a meadow by totalizing inversion such that 0^{-1}=0. Q_0 can be expanded by a total sign function s that extracts the sign of a rational number. In...
Typability in partial groupoids (2009)
Adapting a claim of M. Kracht, we establish a characterization of the typable partial applicative algebras.
Polar ocean acidification: A bipolar view on changes to the marine carbon dioxide system (2008)
Bellerby, R. G. J., Hauck, J., Slagstad, D., Frigstad, H., Hoppema, M., Biebricher, M., ...
A meadow is a commutative ring with an inverse operator satisfying 0(-1) = 0. We determine the initial algebra of the meadows of characteristic 0 and show that its word problem is decidable.
Decision problems for pushdown threads (2007)
Bergstra, J.A., Bethke, I., Ponse, A.
Threads as contained in a thread algebra emerge from the behavioral abstraction from programs in an appropriate program algebra. Threads may make use of services such as stacks, and a thread using a...
Program Algebra and Thread Algebra (2006)
Jan A. Bergstra, Inge Bethke, Alban Ponse, I. Bethke, A. Ponse
These lecture notes comprise slightly abbreviated versions of a number of papers on program algebra and thread algebra. Program algebra in the form of PGA, an algebra of imperative programs dates...
Network algebra in Java (2005)
Network algebra descriptions are translated uniformly to Java yielding a component based simulation model. The model is used to reflect the characteristics of real-world systems.
Polarized process algebra with reactive composition (2005)
Polarized processes are introduced to model the asymmetric interaction of systems. The asymmetry stems from the distinction between service and request. The scheduled concurrent composition of two...
Linear Projective Program Syntax (2004)
Based on an extremely simple program notation more advanced program features can be developed in linear projective program syntax such as conditional statements, while loops, recursion, use of an...
Linear Projective Program Syntax (2004)
Based on an extremely simple program notation more advanced program features can be developed in linear projective program syntax such as conditional statements, while loops, recursion, use of an...
Polarized process algebra and program equivalence (2003)
The basic polarized process algebra is completed yielding as a projective limit a cpo which also comprises infinite processes. It is shown that this model serves in a natural way as a semantics for...
Molecular dynamics is a model for the structure and meaning of object based programming systems. In molecular dynamics the memory state of a system is modeled as a fluid consisting of a collection of...
Data Flow Networks in Java (2000)
J.A. Bergstra, I. Bethke, A. Ponse
A survey of examples is produced highlighting the various features and possibilities with pipes and sockets in Java. An implementation of dataow networks is presented and a realization of the...
Descendants and Origins in Term Rewriting (1999)
I. Bethke, Jan W. Klop, R. De Vrijer, Inge Bethke, Jan Willem Klop, Roel De Vrijer
In this paper we treat various aspects of a notion that is central in term rewriting, namely that of descendants or residuals. We address both first order term rewriting and -calculus, their finitary...
Completing Partial Combinatory Algebras with Unique Head-Normal Forms (1995)
I. Bethke, J. W. Klop, R. De Vrijer, Issn -x, Inge Bethke, Jan Willem Klop, ...
In this note, we prove that having unique head-normal forms is a sufficient condition on partial combinatory algebras to be completable. As application, we show that the pca of strongly normalizing...
Process algebra with combinators (1994)
Bergstra, J.A., Bethke, I., Ponse, A.
We introduce typed combinatory process algebra, a system combining process Mgebra with types and combinators. We describe its syntax and semantics, and by way of example, verify within this framework...
Process Algebra with Iteration and Nesting (1994)
Bergstra, J. A., Bethke, I., Ponse, A.
We introduce iteration in process algebra by means of (the original, binary version of) Kleene's star operation: x*y is the process that chooses between x and y, and upon termination of x has this...