selected scholarly activity
-
books
-
chapters
- Feferman on Computability. Outstanding Contributions to Logic. 23-56. 2017
- Fixed Point Techniques in Analog Systems. 701-711. 2016
- Generalizing Computability Theory to Abstract Algebras. 127-160. 2015
- Computable Functions on Stream Algebras. 397-437. 1995
-
conferences
- Tracking Computability of GPAC-Generable Functions. Lecture Notes in Computer Science. 214-235. 2020
- Analog networks on function data streams. CCA 2016 - 13th International Conference on Computability and Complexity in Analysis - Proceedings. 45-46. 2016
- Assignment Calculus: A Pure Imperative Language. Lecture Notes in Computer Science. 44-58. 2013
- Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms. Applied Mathematics and Computation. 1386-1403. 2009
- Primitive recursive selection functions for existential assertions over abstract algebras. The Journal of Logic and Algebraic Programming. 175-197. 2008
- Computability of analog networks. Theoretical Computer Science. 115-146. 2007
- Primitive Recursive Selection Functions over Abstract Algebras. Lecture Notes in Computer Science. 595-606. 2006
- A Network Model of Analogue Computation over Metric Algebras. Lecture Notes in Computer Science. 515-529. 2005
- Infinitary initial algebra specifications for stream algebras. REFLECTIONS ON THE FOUNDATIONS OF MATHEMATICS. 228-247. 2002
- Table transformation tools: why and how. Proceedings of 11th Annual Conference on Computer Assurance. COMPASS '96. 3-11. 1996
- Propositional temporal logics and their use in model checking. Lecture Notes in Computer Science. 108-116. 1993
- The propositional μ-calculus and its use in model checking. Lecture Notes in Computer Science. 117-128. 1993
- Theory of computation over stream algebras, and its applications. Lecture Notes in Computer Science. 62-80. 1992
- Semantics of pointers, referencing and dereferencing with intensional logic. Proceedings - Symposium on Logic in Computer Science. 127-136. 1991
- Provable computable functions on abstract data types. Lecture Notes in Computer Science. 660-673. 1990
- TOWARD A GENERAL-THEORY OF COMPUTATION AND SPECIFICATION OVER ABSTRACT-DATA-TYPES. ADVANCES IN COMPUTING AND INFORMATION - ICCI 90. 129-133. 1990
- Transition systems, infinitary languages and the semantics of uniform concurrency. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 252-262. 1985
- Denotational semantics of concurrency. Proceedings of the Annual ACM Symposium on Theory of Computing. 153-158. 1982
-
journal articles
- Tracking computability of GPAC-generable functions. Journal of Logic and Computation. 31:326-346. 2021
- APPROXIMABILITY IN THE GPAC. Logical Methods in Computer Science. 15. 2019
- Notions of semicomputability in topological algebras over the reals. Computability. 8:1-26. 2018
- Analog networks on function data streams. Computability. 7:301-322. 2018
- Models of computation for partial functions on the reals. Journal of Logical and Algebraic Methods in Programming. 84:218-237. 2015
- Characterizations of semicomputable sets of real numbers. Journal of Logical and Algebraic Methods in Programming. 84:124-154. 2015
- Computability of Operators on Continuous and Discrete Time Streams. Computability. 3:9-44. 2014
- A Class of Contracting Stream Operators. Computer Journal. 56:15-33. 2013
- Continuity of operators on continuous and discrete time streams. Theoretical Computer Science. 412:3378-3403. 2011
- Universality and semicomputability for nondeterministic programming languages over abstract algebras. The Journal of Logic and Algebraic Programming. 71:44-78. 2007
- First and second order recursion on abstract data types. Fundamenta Informaticae. 67:377-419. 2005
- Computable total functions on metric algebras, universal algebraic specifications and dynamical systems. The Journal of Logic and Algebraic Programming. 62:71-108. 2005
- Abstract versus concrete computation on metric partial algebras. ACM Transactions on Computational Logic. 5:611-668. 2004
- Abstract computability and algebraic specification. ACM Transactions on Computational Logic. 3:279-333. 2002
- Abstract Computability, Algebraic Specification and Initiality. CoRR. cs.LO/0109001. 2001
- Abstract versus Concrete Computation on Metric Partial Algebras. CoRR. cs.LO/0108007. 2001
- Computation by ‘While’ programs on topological partial algebras. Theoretical Computer Science. 219:379-420. 1999
- Transformations of normal and inverted function tables. Formal Aspects of Computing. 8:679-705. 1996
- Deterministic and nondeterministic computation, and horn programs, on abstract data types. The Journal of Logic and Algebraic Programming. 13:23-55. 1992
- A semantic approach to fairness.. Fundam. Informaticae. 16:1-38. 1992
- Examples of semicomputable sets of real and complex numbers. Lecture Notes in Computer Science. 613:179-198. 1992
- THEORY OF COMPUTATION OVER STREAM ALGEBRAS, AND ITS APPLICATIONS. Lecture Notes in Computer Science. 629:62-80. 1992
- PROJECTIONS OF SEMICOMPUTABLE RELATIONS ON ABSTRACT DATA TYPES. International Journal of Foundations of Computer Science. 02:267-296. 1991
- PROVABLE COMPUTABLE FUNCTIONS ON ABSTRACT-DATA-TYPES. Lecture Notes in Computer Science. 443:660-673. 1990
- Toward a general theory of computation and specification over abstract data types. Lecture Notes in Computer Science. 468:129-133. 1990
- Horn programs and semicomputable relations on abstract structures. Lecture Notes in Computer Science. 372:745-760. 1989
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency. Journal of Computer and System Sciences. 36:158-224. 1988
- Contrasting themes in the semantics of imperative concurrency. Lecture Notes in Computer Science. 224:51-121. 1986
- Compactness in semantics for merge and fair merge. Lecture Notes in Computer Science. 164:18-33. 1984
- On infinite computations in denotational semantics. Theoretical Computer Science. 29:229-230. 1984
- On finite computations in denotational semantics. Theoretical Computer Science. 26:53-82. 1983
- Processes and a fair semantics for the ADA rendez-vous. Lecture Notes in Computer Science. 154:52-66. 1983
- Processes and the denotational semantics of concurrency. Information and Computation. 54:70-120. 1982
-
preprints