583 results on '"Jan A. Bergstra"'
Search Results
252. Towards a formalization of budgets
253. Data linkage dynamics with shedding
254. Data linkage algebra, data linkage dynamics, and priority rewriting
255. Instruction sequences for the production of processes
256. Tuplix Calculus Specifications of Financial Transfer Networks
257. On the expressiveness of single-pass instruction sequences
258. Proposition Algebra with Projective Limits
259. Thread algebra for sequential poly-threading
260. Programming an interpreter using molecular dynamics
261. Cancellation Meadows: a Generic Basis Theorem and Some Applications.
262. Module Algebra
263. Projection semantics for rigid loops
264. Interface groups and financial transfer architectures
265. An interface group for process components
266. A process algebra based framework for promise theory
267. Tuplix Calculus
268. A thread calculus with molecular dynamics
269. Machine structure oriented control code logic
270. Program algebra with a jump-shift instruction
271. On the operating unit size of load/store architectures
272. Instruction Sequences with Dynamically Instantiated Instructions
273. Letter from the editor.
274. Bisimulation is Two-Way Simulation.
275. Promises in the Context of Humanoid Robot Morality
276. Fractions in Transrational Arithmetic
277. Promise Theory as a Tool for Informaticians
278. Dual Number Meadows
279. Division by Zero
280. Editor's Note.
281. Guest Editorial.
282. Editorial.
283. Editorial.
284. Instruction sequences expressing multiplication algorithms
285. The rational numbers as an abstract data type.
286. On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions
287. Six Issues Concerning Future Directions in Concurrency Research.
288. The Algebra of Recursively Defined Processes and the Algebra of Regular Processes.
289. Linear Time and Branching Time Semantics for Recursion with Merge.
290. Algebraically Specified Programming Systems and Hoare's Logic.
291. Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras.
292. A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method.
293. Regular extensions of iterative algebras and metric interpretations.
294. Design of a Specification Language by Abstract Syntax Engineering.
295. A Process Specification Formalism Based on Static COLD.
296. ACTtau: A Universal Axiom System for Process Specification.
297. An Axiomatization of the Rational Data Objects.
298. Implicit definability of algebraic structures by means of program properties.
299. Conditional axioms and α/β-calculus in process algebra.
300. Failures without chaos: a new process semantics for fair abstraction.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.