Foundation of a computable solid modeling
Proceedings of the fifth ACM symposium on Solid modeling and applications
Abstract computability and algebraic specification
ACM Transactions on Computational Logic (TOCL)
Some Reflections on Strachey and His Work
Higher-Order and Symbolic Computation
Theoretical Computer Science
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
Streams, Stream Transformers and Domain Representations
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
"Continuous" Multifunctions in Discrete Spaces with Applications to Fixed Point Theory
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
"Continuous" multifunctions in discrete spaces with applications to fixed point theory
Digital and image geometry
Generalized metrics and uniquely determined logic programs
Theoretical Computer Science - Topology in computer science
Continuous domains as formal spaces
Mathematical Structures in Computer Science
On categories generalizing universal domains
Mathematical Structures in Computer Science
Full abstraction, totality and PCF
Mathematical Structures in Computer Science
Theoretical Computer Science - Mathematical foundations of programming semantics
Domain theory and differential calculus (functions of one variable)
Mathematical Structures in Computer Science
Compact metric spaces as minimal-limit sets in domains of bottomed sequences
Mathematical Structures in Computer Science
A uniform approach to logic programming semantics
Theory and Practice of Logic Programming
The largest Cartesian closed category of domains, considered constructively
Mathematical Structures in Computer Science
Two categories of effective continuous cpos
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
Towards a descriptive set theory for domain-like structures
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
Various Constructions of Continuous Information Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Information systems revisited – the general continuous case
Theoretical Computer Science
Effective Computation for Nonlinear Systems
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
On Finite-time Computability Preserving Conversions
Electronic Notes in Theoretical Computer Science (ENTCS)
Implementing Services by Partial State Machines
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Reducibility of domain representations and cantor–weihrauch domain representations
Mathematical Structures in Computer Science
Formal Theories of Information
A Proof of Plotkin's Conjecture
Fundamenta Informaticae
Continuous Functions on Final Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Meet continuity properties of posets
Theoretical Computer Science
Program Self-reference in Constructive Scott Subdomains
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Effective λ-models versus recursively enumerable λ-theories
Mathematical Structures in Computer Science
Domain Equations Based on Sets with Families of Pre-orders
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Polarized process algebra and program equivalence
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Parametric (co)iteration vs. primitive direcursion
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Inverses and quotients of mappings between ordered sets
Image and Vision Computing
Domain representations of spaces of compact subsets
Mathematical Structures in Computer Science
Every Δ20-set is natural, up to turing equivalence
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
On monotone modalities and adjointness
Mathematical Structures in Computer Science
Partial continuous functions and admissible domain representations
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Domain-Theoretic formulation of linear boundary value problems
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
A note on the relationships between logic programs and neural networks
IW-FM'00 Proceedings of the 4th Irish conference on Formal Methods
VDM♣ meets LCF: domain-theoretic and topological aspects of VDM♣
IW-FM'01 Proceedings of the 5th Irish conference on Formal Methods
Multivalued mappings, fixed-point theorems and disjunctive databases
IW-FM'99 Proceedings of the 3rd Irish conference on Formal Methods
A Proof of Plotkin's Conjecture
Fundamenta Informaticae
CARTESIAN STREAM TRANSFORMER COMPOSITION
Fundamenta Informaticae
Lambda theories of effective lambda models
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Generalized Scott Topology on Sets with Families of Pre-orders
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |