Lazy computation with exact real numbers
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Foundation of a computable solid modeling
Proceedings of the fifth ACM symposium on Solid modeling and applications
From Algol to polymorphic linear lambda-calculus
Journal of the ACM (JACM)
Semantics study and reality of computing
ACM Computing Surveys (CSUR)
Making abstract interpretations complete
Journal of the ACM (JACM)
A characterization of symmetric semantics by domain complementation
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Characterising FS domains by means of power domains
Theoretical Computer Science - Domains
Some results on Hahn-Banach-type theorems for continuous D-cones
Theoretical Computer Science - Domains
Partial correctness for probabilistic demonic programs
Theoretical Computer Science
Clausal logic and logic programming in algebraic domains
Information and Computation
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Theoretical Computer Science
Bisimulation indexes and their applications
Theoretical Computer Science
A truly concurrent semantics for a process algebra using resource pomsets
Theoretical Computer Science
Bundle event structures: a revised cpo approach
Information Processing Letters
Nonmonotonic consequences in default domain theory
Annals of Mathematics and Artificial Intelligence
Foundation of a computable solid modelling
Theoretical Computer Science
A category of compositional domain-models for separable stone spaces
Theoretical Computer Science
Models Supporting Nondeterminism and Probabilistic Choice
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Action Refinement for Probabilistic Processes with True Concurrency Models
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
A Renee Equation for Algorithmic Complexity
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Comparing Functional Paradigms for Exact Real-Number Computation
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Measurement Process in Domain Theory
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Ordered Sets and Complete Lattices
Revised Lectures from the International Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
Nondeterminism and Probabilistic Choice: Obeying the Laws
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Adequacy for Algebraic Effects
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
The Informatic Derivative at a Compact Element
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Semantic Characterisations of Second-Order Computability over the Real Numbers
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A Logic for Probabilities in Semantics
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Ordered sets and complete lattices: a primer for computer science
Algebraic and coalgebraic methods in the mathematics of program construction
A fully abstract model for the π-calculus
Information and Computation
A relational account of call-by-value sequentiality
Information and Computation - Special issue: LICS'97
Real PCF extended with integration
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The Scott Topology Induces the Weak Topology
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully-Abstract Model for the p-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Non-Standard Semantics for Program Slicing
Higher-Order and Symbolic Computation
FreshML: programming with binders made simple
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
The topology of Mazurkiewicz traces
Theoretical Computer Science - Topology in computer science
Riemann and Edalat integration on domains
Theoretical Computer Science - Topology in computer science
Theoretical Computer Science - Topology in computer science
The regular spaces with countably based models
Theoretical Computer Science - Topology in computer science
Some points in formal topology
Theoretical Computer Science - Topology in computer science
Information and Computation - TACS 2001
Semantic types: a fresh look at the ideal model for types
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Order-incompleteness and finite Lambda reduction models
Theoretical Computer Science
Sequentiality vs. concurrency in games and logic
Mathematical Structures in Computer Science
Continuous domains as formal spaces
Mathematical Structures in Computer Science
Domain equations for probabilistic processes
Mathematical Structures in Computer Science
Linear types and approximation
Mathematical Structures in Computer Science
Full abstraction, totality and PCF
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
A categorical generalization of Scott domains
Mathematical Structures in Computer Science
An enrichment theorem for an axiomatisation of categories of domains and continuous functions
Mathematical Structures in Computer Science
A simple process algebra based on atomic actions with resources
Mathematical Structures in Computer Science
Composing programs in a rewriting logic for declarative programming
Theory and Practice of Logic Programming
Idempotent analysis and continuous semilattices
Theoretical Computer Science - Logic, semantics and theory of programming
Posets having continuous intervals
Theoretical Computer Science - Logic, semantics and theory of programming
A domain equation for refinement of partial systems
Mathematical Structures in Computer Science
Domain theory and differential calculus (functions of one variable)
Mathematical Structures in Computer Science
On the non-sequential nature of the interval-domain model of real-number computation
Mathematical Structures in Computer Science
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
Theoretical Computer Science - Selected papers of CMCS'03
The largest Cartesian closed category of domains, considered constructively
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
A cartesian closed subcategory of CONT which contains all continuous domains
Information Sciences—Informatics and Computer Science: An International Journal
Transforming semantics by abstract interpretation
Theoretical Computer Science
Distributing probability over non-determinism
Mathematical Structures in Computer Science
On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
On sequential functionals of type 3
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Partial metrisability of continuous posets
Mathematical Structures in Computer Science
Compactly generated domain theory
Mathematical Structures in Computer Science
ACM SIGACT News
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
On the computational content of the Lawson topology
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Probabilistic event structures and domains
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
On a monadic semantics for freshness
Theoretical Computer Science - Applied semantics: Selected topics
Generalized ultrametric spaces in quantitative domain theory
Theoretical Computer Science
A logical approach to stable domains
Theoretical Computer Science
Section-retraction-pairs between fuzzy domains
Fuzzy Sets and Systems
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
Associative Omega-products of Traces
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Event Structures for Arbitrary Disruption
Fundamenta Informaticae
A Hofmann-Mislove theorem for Bitopological Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Non-sequential Nature of Domain Models of Real-number Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
A Convenient Category of Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
Remarks on Testing Probabilistic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Constructive analysis, types and exact real numbers
Mathematical Structures in Computer Science
Complete Orders, Categories and Lattices of Approximations
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
A Categorical View on Algebraic Lattices in Formal Concept Analysis
Fundamenta Informaticae
Semantics of a sequential language for exact real-number computation
Theoretical Computer Science
Discrete random variables over domains
Theoretical Computer Science
A shortcut fusion rule for circular program calculation
Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop
Fundamental study: Complete and directed complete Ω-categories
Theoretical Computer Science
Topology in PVS: continuous mathematics with applications
Proceedings of the second workshop on Automated formal methods
On the Wadge Reducibility of k-Partitions
Electronic Notes in Theoretical Computer Science (ENTCS)
Sequential Real Number Computation and Recursive Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Various Constructions of Continuous Information Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A representation of t-norms in interval-valued L-fuzzy set theory
Fuzzy Sets and Systems
Semantic domains of timed event structures
Programming and Computing Software
Formal topological characterizations of various continuous domains
Computers & Mathematics with Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Dually nondeterministic functions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
A Continuous Derivative for Real-Valued Functions
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Domain Theory and the Causal Structure of Space-Time
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Interval Additive Generators of Interval T-Norms
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
A Domain Theoretic Model of Qubit Channels
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Non-interleaving Semantics with Causality for Nondeterministic Dataflow
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Continuous Fragment of the mu-Calculus
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
A Technique for Verifying Measurements
Electronic Notes in Theoretical Computer Science (ENTCS)
A Functional Algorithm for Exact Real Integration with Invariant Measures
Electronic Notes in Theoretical Computer Science (ENTCS)
Presenting Dcpos and Dcpo Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
CPO semantics of timed interactive actor networks
Theoretical Computer Science
Towards Computability over Effectively Enumerable Topological Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Difference Hierarchy in Countably Based T0-Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Shortcut fusion rules for the derivation of circular and higher-order monadic programs
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Operational domain theory and topology of sequential programming languages
Information and Computation
Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Rough Set Algebras as Description Domains
Fundamenta Informaticae
On the construction of free algebras for equational systems
Theoretical Computer Science
Reducibility of domain representations and cantor–weihrauch domain representations
Mathematical Structures in Computer Science
Logical relations for monadic types†
Mathematical Structures in Computer Science
An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Computability of probability measures and Martin-Löf randomness over metric spaces
Information and Computation
Fuzzy Sets and Systems
A Proof of Plotkin's Conjecture
Fundamenta Informaticae
On Domain Theory over Girard Quantales
Fundamenta Informaticae
The space of formal balls and models of quasi-metric spaces
Mathematical Structures in Computer Science
Experience and Trust ---A Systems-Theoretic Approach
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Forward Analysis for WSTS, Part II: Complete WSTS
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Extending Algebraic Operations to D-Completions
Electronic Notes in Theoretical Computer Science (ENTCS)
Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
First-Order Universality for Real Programs
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
A resolution theorem for algebraic domains
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
ε-Topological formulation of tolerant solid modeling
Computer-Aided Design
Closures in Binary Partial Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Domain Equations Based on Sets with Families of Pre-orders
Electronic Notes in Theoretical Computer Science (ENTCS)
RETRACTED: Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Sequentiality and Piecewise-affinity in Segments of Real-PCF
Electronic Notes in Theoretical Computer Science (ENTCS)
Consistent Partial Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Informatic vs. Classical Differentiation on the Real Line
Electronic Notes in Theoretical Computer Science (ENTCS)
Stably Compact Spaces and the Probabilistic Powerspace construction
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata Games for Multiple-model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards “Dynamic Domains”: Totally Continuous Cocomplete Q-categories
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational Effects in Topological Domain Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
An Operational Domain-theoretic Treatment of Recursive Types
Electronic Notes in Theoretical Computer Science (ENTCS)
Algebraic Information Theory For Binary Channels
Electronic Notes in Theoretical Computer Science (ENTCS)
Continuity in quantitative domains
Fuzzy Sets and Systems
Exact join detection for convex polyhedra and other numerical abstractions
Computational Geometry: Theory and Applications
Quantitative domains via fuzzy sets: Part I: Continuity of fuzzy directed complete posets
Fuzzy Sets and Systems
Comparing free algebras in Topological and Classical Domain Theory
Theoretical Computer Science
Scalar outcomes suffice for finitary probabilistic testing
ESOP'07 Proceedings of the 16th European conference on Programming
Connecting databases with argumentation
INAP'01 Proceedings of the Applications of prolog 14th international conference on Web knowledge management and decision support
Inheriting laws for processes with states
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Parametric (co)iteration vs. primitive direcursion
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
A denotational semantics for total correctness of sequential exact real programs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Simulation hemi-metrics between infinite-state stochastic games
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Prevision domains and convex powercones
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
From coinductive proofs to exact real arithmetic
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
A Boolean Algebra of Contracts for Assume-guarantee Reasoning
Electronic Notes in Theoretical Computer Science (ENTCS)
Domain representations of spaces of compact subsets
Mathematical Structures in Computer Science
Selection functions, bar recursion and backward induction
Mathematical Structures in Computer Science
De groot duality and models of choice: Angels, demons and nature†
Mathematical Structures in Computer Science
The limit–colimit coincidence theorem for -categories
Mathematical Structures in Computer Science
Noetherian spaces in verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Extensional higher-order logic programming
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
Semantical proofs of correctness for programs performing non-deterministic tests on real numbers
Mathematical Structures in Computer Science
Foundations of uncertain-data integration
Proceedings of the VLDB Endowment
Reasoning about probabilistic security using task-PIOAs
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
A semantics for lazy assertions
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
On the resolution-based family of abstract argumentation semantics and its grounded instance
Artificial Intelligence
Canonical extensions and canonicity via dcpo presentations
Theoretical Computer Science
The formal ball model for -categories
Mathematical Structures in Computer Science
Deriving labels and bisimilarity for concurrent constraint programming
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
An adequate, denotational, functional-style semantics for typed FlatCurry
WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
Finitary functors: from set to preord and poset
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
A counterexample to tensorability of effects
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
On the Kolmogorov complexity of continuous real functions
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Observationally-induced Effect Monads: Upper and Lower Powerspace Constructions
Electronic Notes in Theoretical Computer Science (ENTCS)
Static analysis in disjunctive numerical domains
SAS'06 Proceedings of the 13th international conference on Static Analysis
Physical systems as constructive logics
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Presenting functors by operations and equations
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Denotational semantics of hybrid automata
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Partial continuous functions and admissible domain representations
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Discrete random variables over domains
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A survey of fuzzifications of frames, the Papert--Papert--Isbell adjunction and sobriety
Fuzzy Sets and Systems
Concurrent semantics without the notions of state or state transitions
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
The extended probabilistic powerdomain monad over stably compact spaces
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
A domain theoretic account of euler's method for solving initial value problems
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Axiomatic constructor classes in Isabelle/HOLCF
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
A general framework for representing, reasoning and querying with annotated Semantic Web data
Web Semantics: Science, Services and Agents on the World Wide Web
Completeness and compactness of quantitative domains
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A computational model for multi-variable differential calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Ultrafilter extensions for coalgebras
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
An abstract strong normalization theorem
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Combining datatypes and effects
AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
Querying formal contexts with answer set programs
ICCS'06 Proceedings of the 14th international conference on Conceptual Structures: inspiration and Application
Domain-Theoretic formulation of linear boundary value problems
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
On continuous models of computation: towards computing the distance between (logic) programs
IWFM'03 Proceedings of the 6th international conference on Formal Methods
Shortcut fusion rules for the derivation of circular and higher-order programs
Higher-Order and Symbolic Computation
Rough Set Algebras as Description Domains
Fundamenta Informaticae
On Domain Theory over Girard Quantales
Fundamenta Informaticae
A Proof of Plotkin's Conjecture
Fundamenta Informaticae
TFP'11 Proceedings of the 12th international conference on Trends in Functional Programming
The theory of WSTS: the case of complete WSTS
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Complete Orders, Categories and Lattices of Approximations
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
A Categorical View on Algebraic Lattices in Formal Concept Analysis
Fundamenta Informaticae
Associative Omega-products of Traces
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Event Structures for Arbitrary Disruption
Fundamenta Informaticae
On Topological Hierarchies of Temporal Properties
Fundamenta Informaticae
Multi Lingual Sequent Calculus and Coherent Spaces
Fundamenta Informaticae
A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed vs. Untyped Realizability
Electronic Notes in Theoretical Computer Science (ENTCS)
Fundamenta Informaticae
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Equational systems and free constructions
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Continuous capacities on continuous state spaces
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Spatial and epistemic modalities in constraint-based process calculi
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
An equational approach to secure multi-party computation
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Full abstraction for nominal Scott domains
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hyperstream processing systems: nonstandard modeling of continuous-time signals
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A computational model for multi-variable differential calculus
Information and Computation
Atanassov's intuitionistic fuzzy probability and Markov chains
Knowledge-Based Systems
Extensional Higher-Order Logic Programming
ACM Transactions on Computational Logic (TOCL)
Category-theoretic fuzzy topological spaces and their dualities
Fuzzy Sets and Systems
Proofs you can believe in: proving equivalences between Prolog semantics in Coq
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
A semantics for weakly encapsulated search in functional logic programs
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Loop invariants: Analysis, classification, and examples
ACM Computing Surveys (CSUR)
Exploring system architectures in AADL via Polychrony and SynDEx
Frontiers of Computer Science: Selected Publications from Chinese Universities
Formal verification of synchronous data-flow program transformations toward certified compilers
Frontiers of Computer Science: Selected Publications from Chinese Universities
Two cartesian closed subcategories of fuzzy domains
Fuzzy Sets and Systems
Completely Precontinuous Posets
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Tω as a Stable Universal Domain
Electronic Notes in Theoretical Computer Science (ENTCS)
Observationally-induced Algebras in Domain Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Characterising E-projectives via Co-monads
Electronic Notes in Theoretical Computer Science (ENTCS)
Generalized Scott Topology on Sets with Families of Pre-orders
Electronic Notes in Theoretical Computer Science (ENTCS)
A categorical representation of algebraic domains based on variations of rough approximable concepts
International Journal of Approximate Reasoning
On the Validation of Invariants at Runtime
Fundamenta Informaticae
Hi-index | 0.02 |