Jan A. Bergstra

According to our database1, Jan A. Bergstra
  • authored at least 303 papers between 1977 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Contradiction-Tolerant Process Algebra with Propositional Signals.
Fundam. Inform., 2017

Process algebra with strategic interleaving.
CoRR, 2017

Axioms for behavioural congruence of single-pass instruction sequences.
CoRR, 2017

2016
Transformation of fractions into simple fractions in divisive meadows.
J. Applied Logic, 2016

Instruction Sequence Size Complexity of Parity.
Fundam. Inform., 2016

On Instruction Sets for Boolean Registers in Program Algebra.
Sci. Ann. Comp. Sci., 2016

Datatype defining rewrite systems for the ring of integers, and for natural and integer arithmetic in unary view.
CoRR, 2016

Adams Conditioning and Likelihood Ratio Transfer Mediated Inference.
CoRR, 2016

2015
Division by zero in non-involutive meadows.
J. Applied Logic, 2015

Equations for formally real meadows.
J. Applied Logic, 2015

Note on paraconsistency and reasoning about fractions.
Journal of Applied Non-Classical Logics, 2015

On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions.
Fundam. Inform., 2015

Probabilistic Thread Algebra.
Sci. Ann. Comp. Sci., 2015

Evaluation trees for proposition algebra.
CoRR, 2015

Transformation of fractions into simple fractions in divisive meadows.
CoRR, 2015

Contradiction-tolerant process algebra with propositional signals.
CoRR, 2015

On instruction sets for Boolean registers in program algebra.
CoRR, 2015

Architectural Adequacy and Evolutionary Adequacy as Characteristics of a Candidate Informational Money.
CoRR, 2015

Evaluation Trees for Proposition Algebra - The Case for Free and Repetition-Proof Valuation Congruence.
Proceedings of the Correct System Design, 2015

Division by Zero in Common Meadows.
Proceedings of the Software, 2015

2014
Editor's Note.
J. Log. Algebr. Meth. Program., 2014

Instruction Sequence Based Non-uniform Complexity Classes.
Sci. Ann. Comp. Sci., 2014

Bitcoin: a Money-like Informational Commodity.
CoRR, 2014

Three Datatype Defining Rewrite Systems for Datatypes of Integers each extending a Datatype of Naturals.
CoRR, 2014

Division by zero in non-involutive meadows.
CoRR, 2014

Instruction sequence size complexity of parity.
CoRR, 2014

A Thread Algebra with Probabilistic Features.
CoRR, 2014

A Hoare-like logic of asserted single-pass instruction sequences.
CoRR, 2014

On algorithmic equivalence of instruction sequences for computing bit string functions.
CoRR, 2014

Note on paraconsistency and the logic of fractions.
CoRR, 2014

Promises, Impositions, and other Directionals.
CoRR, 2014

Personal Multi-threading.
CoRR, 2014

2013
Editorial.
Sci. Comput. Program., 2013

A Process Calculus with Finitary Comprehended Terms.
Theory Comput. Syst., 2013

Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting.
Fundam. Inform., 2013

Obituary for Jaco de Bakker, 1939-2012.
Bulletin of the EATCS, 2013

Timed Tuplix Calculus and the Wesseling and van den Bergh Equation.
Sci. Ann. Comp. Sci., 2013

Questions related to Bitcoin and other Informational Money
CoRR, 2013

Bitcoin and Beyond: Exclusively Informational Monies
CoRR, 2013

Network algebra for synchronous dataflow
CoRR, 2013

Instruction sequence based non-uniform complexity classes
CoRR, 2013

Long multiplication by instruction sequences with backward jump instructions.
CoRR, 2013

Instruction sequence expressions for the Karatsuba multiplication algorithm.
CoRR, 2013

Instruction sequence expressions for the secure hash algorithm SHA-256.
CoRR, 2013

Equations for formally real meadows.
CoRR, 2013

Decision Taking versus Promise Issuing.
CoRR, 2013

Cancellation Meadows: A Generic Basis Theorem and Some Applications.
Comput. J., 2013

Guest Editorial.
Comput. J., 2013

2012
Instruction Sequences for Computer Science.
Atlantis Studies in Computing 2, Atlantis Press, ISBN: 978-94-91216-65-7, 2012

On the Expressiveness of Single-Pass Instruction Sequences.
Theory Comput. Syst., 2012

On the Contribution of Backward Jumps to Instruction Sequence Expressiveness.
Theory Comput. Syst., 2012

On the Behaviours Produced by Instruction Sequences under Execution.
Fundam. Inform., 2012

Indirect Jumps Improve Instruction Sequence Performance.
Sci. Ann. Comp. Sci., 2012

Informaticology: combining Computer Science, Data Science, and Fiction Science
CoRR, 2012

Decision Taking for Selling Thread Startup
CoRR, 2012

Decision Taking versus Action Determination
CoRR, 2012

Decision Taking as a Service
CoRR, 2012

Process algebra with conditionals in the presence of epsilon
CoRR, 2012

Four Conceptions of Instruction Sequence Faults
CoRR, 2012

Turing Impossibility Properties for Stack Machine Programming
CoRR, 2012

About Instruction Sequence Testing
CoRR, 2012

Instruction sequence processing operators.
Acta Inf., 2012

2011
Proposition algebra.
ACM Trans. Comput. Log., 2011

A calculus for four-valued sequential logic.
Theor. Comput. Sci., 2011

Editorial.
Sci. Comput. Program., 2011

Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows.
Theory Comput. Syst., 2011

Inversive meadows and divisive meadows.
J. Applied Logic, 2011

Thread algebra for poly-threading.
Formal Asp. Comput., 2011

Thread Extraction for Polyadic Instruction Sequences.
Sci. Ann. Comp. Sci., 2011

Informatics Perspectives on Decision Taking
CoRR, 2011

Stratified Outsourcing Theory
CoRR, 2011

Putting Instruction Sequences into Effect
CoRR, 2011

Outsourcing Competence
CoRR, 2011

Introducing Sourcements
CoRR, 2011

On the behaviours produced by instruction sequences under execution
CoRR, 2011

Real Islamic Logic
CoRR, 2011

Proposition Algebra and Short-Circuit Logic.
Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

2010
On the operating unit size of load/store architectures.
Mathematical Structures in Computer Science, 2010

A thread calculus with molecular dynamics.
Inf. Comput., 2010

Data Linkage Dynamics with Shedding.
Fundam. Inform., 2010

An Interface Group for Process Components.
Fundam. Inform., 2010

Business Mereology: Imaginative Definitions of Insourcing and Outsourcing Transformations
CoRR, 2010

On Hoare-McCarthy algebras
CoRR, 2010

Short-circuit logic
CoRR, 2010

Steering Fragments of Instruction Sequences
CoRR, 2010

Informal Control code logic
CoRR, 2010

Formaleuros, formalcoins and virtual monies
CoRR, 2010

On the definition of a theoretical concept of an operating system
CoRR, 2010

On the contribution of backward jumps to instruction sequence expressiveness
CoRR, 2010

2009
Meadows and the equational specification of division.
Theor. Comput. Sci., 2009

Instruction Sequences with Dynamically Instantiated Instructions.
Fundam. Inform., 2009

An Instruction Sequence Semigroup with Involutive Anti-Automorphisms.
Sci. Ann. Comp. Sci., 2009

Local and Global Trust Based on the Concept of Promises
CoRR, 2009

Autosolvability of halting problem instances for instruction sequences
CoRR, 2009

Functional units for natural numbers
CoRR, 2009

Instruction sequence processing operators
CoRR, 2009

A progression ring for interfaces of instruction sequences, threads, and services
CoRR, 2009

Indirect jumps improve instruction sequence performance
CoRR, 2009

Arithmetical meadows
CoRR, 2009

Instruction sequence notations with probabilistic instructions
CoRR, 2009

Straight-line instruction sequence completeness for total calculation on cancellation meadows
CoRR, 2009

A protocol for instruction stream processing
CoRR, 2009

A process calculus with finitary comprehended terms
CoRR, 2009

An Instruction Sequence Semigroup with Involutive Anti-Automorphisms
CoRR, 2009

Transmission protocols for instruction streams
CoRR, 2009

Square root meadows
CoRR, 2009

Meadow Enriched ACP Process Algebras
CoRR, 2009

Timed tuplix calculus and the Wesseling and van den Berg equation
CoRR, 2009

Partial Komori fields and imperative Komori fields.
CoRR, 2009

Inversive Meadows and Divisive Meadows.
CoRR, 2009

Machine structure oriented control code logic.
Acta Inf., 2009

Transmission Protocols for Instruction Streams.
Proceedings of the Theoretical Aspects of Computing, 2009

2008
Division Safe Calculation in Totalised Fields.
Theory Comput. Syst., 2008

Maurer computers for pipelined instruction processing.
Mathematical Structures in Computer Science, 2008

Program algebra with a jump-shift instruction.
J. Applied Logic, 2008

Simulating Turing machines on Maurer machines.
J. Applied Logic, 2008

Distributed strategic interleaving with load balancing.
Future Generation Comp. Syst., 2008

Parallel Processes with Implicit Computational Capital.
Electr. Notes Theor. Comput. Sci., 2008

Tuplix Calculus.
Sci. Ann. Comp. Sci., 2008

Instruction sequences for the production of processes
CoRR, 2008

A static theory of promises
CoRR, 2008

An Instruction Sequence Semigroup with Repeaters
CoRR, 2008

On the expressiveness of single-pass instruction sequences
CoRR, 2008

Mechanistic Behavior of Single-Pass Instruction Sequences
CoRR, 2008

Instruction sequences and non-uniform complexity theory
CoRR, 2008

Proposition Algebra with Projective Limits
CoRR, 2008

Data linkage dynamics with shedding
CoRR, 2008

Tuplix Calculus Specifications of Financial Transfer Networks
CoRR, 2008

Data linkage algebra, data linkage dynamics, and priority rewriting
CoRR, 2008

Thread algebra for sequential poly-threading
CoRR, 2008

Towards a formalization of budgets
CoRR, 2008

Thread extraction for polyadic instruction sequences
CoRR, 2008

Programming an interpreter using molecular dynamics
CoRR, 2008

Differential Meadows.
CoRR, 2008

Cancellation Meadows: a Generic Basis Theorem and Some Applications.
CoRR, 2008

Fields, Meadows and Abstract Data Types.
Proceedings of the Pillars of Computer Science, 2008

2007
About "trivial" software patents: The IsNot case.
Sci. Comput. Program., 2007

Letter from the editor.
Sci. Comput. Program., 2007

A Thread Algebra with Multi-Level Strategic Interleaving.
Theory Comput. Syst., 2007

Preferential choice and coordination conditions.
J. Log. Algebr. Program., 2007

Execution architectures for program algebra.
J. Applied Logic, 2007

The rational numbers as an abstract data type.
J. ACM, 2007

Maurer Computers with Single-Thread Control.
Fundam. Inform., 2007

Thread algebra for strategic interleaving.
Formal Asp. Comput., 2007

Programming an Interpreter Using Molecular Dynamics.
Sci. Ann. Comp. Sci., 2007

Instruction Sequences with Indirect Jumps.
Sci. Ann. Comp. Sci., 2007

Tuplix Calculus
CoRR, 2007

Program algebra with a jump-shift instruction
CoRR, 2007

Instruction Sequences with Dynamically Instantiated Instructions
CoRR, 2007

A thread calculus with molecular dynamics
CoRR, 2007

On the operating unit size of load/store architectures
CoRR, 2007

Machine structure oriented control code logic
CoRR, 2007

An interface group for process components
CoRR, 2007

Instruction sequences with indirect jumps
CoRR, 2007

Interface groups and financial transfer architectures
CoRR, 2007

Projection semantics for rigid loops
CoRR, 2007

A process algebra based framework for promise theory
CoRR, 2007

Synchronous cooperation for explicit multi-threading.
Acta Inf., 2007

Decision problems for pushdown threads.
Acta Inf., 2007

2006
Continuity controlled hybrid automata.
J. Log. Algebr. Program., 2006

Splitting bisimulations and retrospective conditions.
Inf. Comput., 2006

Thread Algebra with Multi-Level Strategies.
Fundam. Inform., 2006

On the Design Rationale of ACP Style Process Algebras.
Electr. Notes Theor. Comput. Sci., 2006

Six Themes for Future Concurrency Research.
Electr. Notes Theor. Comput. Sci., 2006

Elementary Algebraic Specifications of the Rational Function Field.
Proceedings of the Logical Approaches to Computational Barriers, 2006

Elementary Algebraic Specifications of the Rational Complex Numbers.
Proceedings of the Algebra, Meaning, and Computation, 2006

2005
Process algebra for hybrid systems.
Theor. Comput. Sci., 2005

Polarized process algebra with reactive composition.
Theor. Comput. Sci., 2005

Network algebra in Java.
J. Log. Algebr. Program., 2005

An upper bound for the equational specification of finite state services.
Inf. Process. Lett., 2005

A Bypass of Cohen's Impossibility Result.
Proceedings of the Advances in Grid Computing, 2005

A Thread Algebra with Multi-level Strategic Interleaving.
Proceedings of the New Computational Paradigms, 2005

Strong Splitting Bisimulation Equivalence.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

Model Theory for Process Algebra.
Proceedings of the Processes, 2005

2004
Located Actions in Process Algebra with Timing.
Fundam. Inform., 2004

2003
Branching time and orthogonal bisimulation equivalence.
Theor. Comput. Sci., 2003

Operator programs and operator processes.
Information & Software Technology, 2003

Polarized Process Algebra and Program Equivalence.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Machine Function Based Control Code Algebras.
Proceedings of the Formal Methods for Components and Objects, 2003

2002
Combining programs and state machines.
J. Log. Algebr. Program., 2002

Program algebra for sequential code.
J. Log. Algebr. Program., 2002

Molecular dynamics.
J. Log. Algebr. Program., 2002

Molecule-oriented programming in Java.
Information & Software Technology, 2002

2001
Non-regular iterators in process algebra.
Theor. Comput. Sci., 2001

Register-machine based processes.
J. ACM, 2001

Process algebra and conditional composition.
Inf. Process. Lett., 2001

2000
Process Algebra with Four-Valued Logic.
Journal of Applied Non-Classical Logics, 2000

Program Algebra for Component Code.
Formal Asp. Comput., 2000

Discrete time process algebra with silent step.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1998
The Discrete Time TOOLBUS - A Software Coordination Architecture.
Sci. Comput. Program., 1998

Bochvar-McCarthy Logic and Process Algebra.
Notre Dame Journal of Formal Logic, 1998

Kleene's Three-Valued Logic and Process Algebra.
Inf. Process. Lett., 1998

Deadlock Behaviour in Split and ST Bisimulation Semantics.
Electr. Notes Theor. Comput. Sci., 1998

Grid Protocol Specifications.
Proceedings of the Prospects for Hardware Foundations, ESPRIT Working Group 8533, NADA, 1998

1997
Toward a Complete Transformational Toolkit for Compilers.
ACM Trans. Program. Lang. Syst., 1997

Process Algebra with Propositional Signals.
Theor. Comput. Sci., 1997

Grid Protocols Based on Synchronous Communication.
Sci. Comput. Program., 1997

Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time.
Fundam. Inform., 1997

Models for Feature Descriptions and Interactions.
Proceedings of the Feature Interactions in Telecommunications Networks IV, 1997

Bounded Stacks, Bags and Queues.
Proceedings of the CONCUR '97: Concurrency Theory, 1997

1996
Processes with Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation.
Fundam. Inform., 1996

Discrete Time Process Algebra.
Formal Asp. Comput., 1996

Six Issues Concerning Future Directions in Concurrency Research.
ACM Comput. Surv., 1996

A Complete Transformational Toolkit for Compilers.
Proceedings of the Programming Languages and Systems, 1996

The TOOLBUS Coordination Architecture.
Proceedings of the Coordination Languages and Models, First International Conference, 1996

The Discrete Time TOOLBUS.
Proceedings of the Algebraic Methodology and Software Technology, 1996

1995
Axiomatizing Probabilistic Processes: ACP with Generative Probabilities
Inf. Comput., September, 1995

Homomorphism Preserving Algebraic Specifications Require Hidden Sorts
Inf. Comput., May, 1995

A propositional logic with 4 values: true, false, divergent and meaningless.
Journal of Applied Non-Classical Logics, 1995

Equational Specifications, Complete Term Rewriting Systems, and Computable and Semicomputable Algebras.
J. ACM, 1995

A Data Type Variety of Stack Algebras.
Ann. Pure Appl. Logic, 1995

Processes with Multiple Entries and Exits.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

Discrete Time Process Algebra with Abstraction.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994
Which Data Types have omega-complete Initial Algebra Specifications?
Theor. Comput. Sci., 1994

Logic of Transition Systems.
Journal of Logic, Language and Information, 1994

Bisimulation is Two-Way Simulation.
Inf. Process. Lett., 1994

On Sequential Compoisiton, Action Prefixes and Process Prefixes.
Formal Asp. Comput., 1994

Process Algebra with Iteration and Nesting.
Comput. J., 1994

A Real Time Process Logic.
Proceedings of the Temporal Logic, First International Conference, 1994

Process Algebra with Partial Choice.
Proceedings of the CONCUR '94, 1994

1993
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages.
J. ACM, 1993

Real space process algebra.
Formal Asp. Comput., 1993

Process Algebra with Backtracking.
Proceedings of the A Decade of Concurrency, Reflections and Perspectives, 1993

Translations Between Flowchart Schemes and Process Graphs.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

Process Algebra with Combinators.
Proceedings of the Computer Science Logic, 7th Workshop, 1993

Non Interleaving Process Algebra.
Proceedings of the CONCUR '93, 1993

1992
Asynchronous Communication in Real Space Process Algebra.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1992

Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract).
Proceedings of the CONCUR '92, 1992

Discrete Time Process Algebra.
Proceedings of the CONCUR '92, 1992

1991
Recursive Process Definitions with the State Operator.
Theor. Comput. Sci., 1991

Uniform Algebraic Specifications of Finite Sets with Equality.
Int. J. Found. Comput. Sci., 1991

Real Time Process Algebra.
Formal Asp. Comput., 1991

The State Operator in Real Time Process Algebra.
Proceedings of the Real-Time: Theory in Practice, 1991

Real Space Process Algebra.
Proceedings of the CONCUR '91, 1991

1990
Module Algebra
J. ACM, April, 1990

Process Algebra with a Zero Object.
Proceedings of the CONCUR '90, 1990

1989
Term-Rewriting Systems with Rule Priorities.
Theor. Comput. Sci., 1989

Design of a Specification Language by Abstract Syntax Engineering.
Proceedings of the Algebraic Methods II: Theory, 1989

A Process Specification Formalism Based on Static COLD.
Proceedings of the Algebraic Methods II: Theory, 1989

1988
Global Renaming Operators in Concrete Process Algebra
Inf. Comput., September, 1988

Readies and Failures in the Algebra of Communicating Processes.
SIAM J. Comput., 1988

Process theory based on bisimulation semantics.
Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

ACP with Signals.
Proceedings of the Algebraic and Logic Programming, 1988

1987
Algebraic Specifications of Computable and Semicomputable Data Types.
Theor. Comput. Sci., 1987

On the Consistency of Koomen's Fair Abstraction Rule.
Theor. Comput. Sci., 1987

Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator.
Comput. J., 1987

Term Rewriting Systems with Priorities.
Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages.
Proceedings of the PARLE, 1987

ACTtau: A Universal Axiom System for Process Specification.
Proceedings of the Algebraic Methods: Theory, 1987

1986
Conditional Rewrite Rules: Confluence and Termination.
J. Comput. Syst. Sci., 1986

1985
Algebra of Communicating Processes with Abstraction.
Theor. Comput. Sci., 1985

Top-Down Design and the Algebra of Communicating Processes.
Sci. Comput. Program., 1985

Verification of an alternating bit protocol by means of process algebra.
Proceedings of the Mathematical Methods of Specification and Synthesis of Software Systems '85, 1985

1984
Hoare's Logic for Programming Languages with two Data Types.
Theor. Comput. Sci., 1984

Proving Program Inclusion Using Hoare's Logic.
Theor. Comput. Sci., 1984

Linear Time and Branching Time Semantics for Recursion with Merge.
Theor. Comput. Sci., 1984

Process Algebra for Synchronous Communication
Information and Control, 1984

On Specifying Sets of Integers.
Elektronische Informationsverarbeitung und Kybernetik, 1984

The Axiomatic Semantics of Programs Based on Hoare's Logic.
Acta Inf., 1984

The Algebra of Recursively Defined Processes and the Algebra of Regular Processes.
Proceedings of the Automata, 1984

Process Algebra with Asynchronous Communication Mechanisms.
Proceedings of the Seminar on Concurrency, 1984

1983
Hoare's Logic and Peano's Arithmetic.
Theor. Comput. Sci., 1983

Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems.
SIAM J. Comput., 1983

A proof rule for restoring logic circuits.
Integration, 1983

Initial Algebra Specifications for Parametrized Data Types.
Elektronische Informationsverarbeitung und Kybernetik, 1983

Standard Model Semantics for DSL A Data Type Specification Language.
Acta Inf., 1983

PC-Compactness, a Necessary Condition for the Existence of Sound and Complete Logics of Partial Correctness.
Proceedings of the Logics of Programs, 1983

Algebraic Tools for System Construction.
Proceedings of the Logics of Programs, 1983

Linear Time and Branching Time Semantics for Recursion with Merge.
Proceedings of the Automata, 1983

1982
The Completeness of the Algebraic Specification Methods for Computable Data Types
Information and Control, September, 1982

Another Incompleteness Result for Hoare's Logic
Information and Control, February, 1982

Floyds Principle, Correctness Theories and Program Equivalence.
Theor. Comput. Sci., 1982

Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs.
Theor. Comput. Sci., 1982

On the Elimination of Iteration Quantifiers in a Fragment of Algorithmic Logic.
Theor. Comput. Sci., 1982

Expressiveness and the Completeness of Hoare's Logic.
J. Comput. Syst. Sci., 1982

Two Theorems About the Completeness of Hoare's Logic.
Inf. Process. Lett., 1982

A Simple Transfer Lemma for Algebraic Specifications.
Inf. Process. Lett., 1982

Strong Normalization and Perpetual Reductions in the Lambda Calculus.
Elektronische Informationsverarbeitung und Kybernetik, 1982

A formalized proof system for total correctness of while programs.
Proceedings of the International Symposium on Programming, 1982

Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras.
Proceedings of the Automata, 1982

Specification of Parameterized Data Types.
ADT, 1982

1981
Regular extensions of iterative algebras and metric interpretations.
Fundam. Inform., 1981

Algorithmic degrees of algebraic structures.
Fundam. Inform., 1981

Logic of effective definitions.
Fundam. Inform., 1981

On the quantifier-free fragment of 'Logic of effective definitions'.
Fundam. Inform., 1981

On the Power of Algebraic Specifications.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

The Refinement of Specifications and the Stabiliy of Hoare's Logic.
Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, May 1981, 1981

Hoare's Logic is Incomplete When It Does Not Have To Be.
Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, May 1981, 1981

Algebraically Specified Programming Systems and Hoare's Logic.
Proceedings of the Automata, 1981

A Characterization of Program Equivalence in Terms of Hoare's Logic.
Proceedings of the GI, 1981

1980
Invertible Terms in the Lambda Calculus.
Theor. Comput. Sci., 1980

Discourse between processes.
Notre Dame Journal of Formal Logic, 1980

A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method.
Proceedings of the Automata, 1980

Regular extensions of iterative algebras and metric interpretations.
Proceedings of the Proc. 5eme Colleque de Lille sur les Arbres en Algebre et en Programmation, 1980

1979
Church-Rosser Strategies in the Lambda Calculus.
Theor. Comput. Sci., 1979

Recursive Assertions are not enough - or are they?
Theor. Comput. Sci., 1979

Effective Transformations on Probabilistic Data.
Math. Log. Q., 1979

Implicit definability of algebraic structures by means of program properties.
FCT, 1979

1978
Degrees of partial functions.
Notre Dame Journal of Formal Logic, 1978

Degrees of Sensible Lambda Theories.
J. Symb. Log., 1978

What is an Abstract Datatype?
Inf. Process. Lett., 1978

Decision Problems Concerning Parallel Programming.
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977
An Axiomatization of the Rational Data Objects.
FCT, 1977


  Loading...