POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Models of continuations without continuations
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Observable sequentiality and full abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Termination, deadlock, and divergence
Journal of the ACM (JACM)
Science, computational science, and computer science: at a crossroads
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Proving concurrent constraint programs correct
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A framework for programming denotational semantics in C++
ACM SIGPLAN Notices
Proving concurrent constraint programs correct
ACM Transactions on Programming Languages and Systems (TOPLAS)
Experimenting with power default reasoning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A semantics for complex objects and approximate queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Towards a semantic theory for equational programming languages
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Information systems as implementations (abstract only)
CSC '87 Proceedings of the 15th annual conference on Computer Science
Semantics of combinations in scheme
ACM SIGPLAN Lisp Pointers
On category theory as a (meta) ontology for information systems research
Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001
Intersection types for λ-trees
Theoretical Computer Science - Special issue on theories of types and proofs
Nonmonotonic consequences in default domain theory
Annals of Mathematics and Artificial Intelligence
Logical considerations on default semantics
Annals of Mathematics and Artificial Intelligence
Pinnacles of software engineering: 25 years of formal methods
Annals of Software Engineering
A cartesian closed category in Martin-Löf's intuitionistic type theory
Theoretical Computer Science
A logical view of concurrent constraint programming
Nordic Journal of Computing
Soft Constraints for Security Protocol Analysis: Confidentiality
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
Infinite Intersection and Union Types for the Lazy Lambda Calculus
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Knowledge Representation in Extended Pawlak's Information Systems: Algebraic Aspects
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
A Fully Abstract Model for Higher-Order Mobile Ambients
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Revised Lectures from the International Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
Abstract Computability of Non-deterministic Programs over Various Data Structures
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Sequents, Frames, and Completeness
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Algebraic and coalgebraic methods in the mathematics of program construction
The semantics of local storage, or what makes the free-list free?(Preliminary Report)
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Reverse Engineering Legacy Information Systems for Internet Based Interoperation
ICSM '01 Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01)
Computational topology: ambient isotopic approximation of 2-manifolds
Theoretical Computer Science - Topology in computer science
Theoretical Computer Science - Topology in computer science
Some points in formal topology
Theoretical Computer Science - Topology in computer science
Information and Computation - TACS 2001
Probabilistic argumentation systems a new way to combine logic with probability
Journal of Applied Logic - Special issue on combining probability and logic
Locally Determined Logic Programs and Recursive Stable Models
Annals of Mathematics and Artificial Intelligence
Universal homogeneous graph-like structures and domains
Mathematical Structures in Computer Science
A semantics for lambda calculi with resources
Mathematical Structures in Computer Science
On categories generalizing universal domains
Mathematical Structures in Computer Science
A filter model for mobile processes
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
A categorical generalization of Scott domains
Mathematical Structures in Computer Science
The semantics of grammar formalisms seen as computer languages
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
The design of a computer language for linguistic information
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
A logical semantics for nonmonotonic sorts
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
A general framework for lazy functional logic programming with algebraic polymorphic types
Theory and Practice of Logic Programming
Building continuous webbed models for system F
Theoretical Computer Science - Mathematical foundations of programming semantics
Behavioural inverse limit λ-models
Theoretical Computer Science - Logic, semantics and theory of programming
Theoretical Computer Science - Logic, semantics and theory of programming
Presenting locale pullback via directed complete posets
Theoretical Computer Science - Logic, semantics and theory of programming
Entailment systems for stably locally compact locales
Theoretical Computer Science - Logic, semantics and theory of programming
Predicate Transformers as Homomorphisms on Scott's Information Systems
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Cartesian closed stable categories
Information Sciences—Informatics and Computer Science: An International Journal
A fully abstract may testing semantics for concurrent objects
Theoretical Computer Science
Information and Computation
Soft concurrent constraint programming
ACM Transactions on Computational Logic (TOCL)
Skeptical Reasoning in FC-Normal Logic Programs is Π^1_1-complete
Fundamenta Informaticae
Normalization by Evaluation for Martin-Löf Type Theory with One Universe
Electronic Notes in Theoretical Computer Science (ENTCS)
A Categorical View on Algebraic Lattices in Formal Concept Analysis
Fundamenta Informaticae
On the relations between monadic semantics
Theoretical Computer Science
A new generic scheme for functional logic programming with constraints
Higher-Order and Symbolic Computation
Mediating secure information flow policies
Information and Computation
Database interoperability through state-based logical data independence
International Journal of Computer Applications in Technology
An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models
Electronic Notes in Theoretical Computer Science (ENTCS)
Compactness Properties for Stable Semantics of Logic Programs
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Theoretical Computer Science
Various Constructions of Continuous Information Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
On computational environments of topological spaces
Theoretical Computer Science
Information systems revisited – the general continuous case
Theoretical Computer Science
Devolved Ontology for Smart Applications
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
Theoretical 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
A Proof of Plotkin's Conjecture
Fundamenta Informaticae
Interactive Computation: Stepping Stone in the Pathway From Classical to Developmental Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Constraint Functional Logic Programming Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Priestley Duality for Strong Proximity Lattices
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
Stable computational semantics of conflict-free rewrite systems (partial orders with duplication)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Fundamental study: The multiple facets of the canonical direct unit implicational basis
Theoretical Computer Science
Recursive domain equations of filter models
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Topology vs generalized rough sets
International Journal of Approximate Reasoning
Approximation semantics and expressive predicate assignment for object-oriented programming
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Inference with idempotent valuations
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
The predicate-minimizing logic MIN
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
A topological approach of the web classification
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
A survey of constraint-based programming paradigms
Computer Science Review
A Proof of Plotkin's Conjecture
Fundamenta Informaticae
Compactness Properties for Stable Semantics of Logic Programs
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
A Categorical View on Algebraic Lattices in Formal Concept Analysis
Fundamenta Informaticae
Skeptical Reasoning in FC-Normal Logic Programs is Π^1_1-complete
Fundamenta Informaticae
Fundamenta Informaticae
Complexity of Recursive Normal Default Logic
Fundamenta Informaticae
A Convex Powerdomain over Lattices: its Logic and λ-Calculus
Fundamenta Informaticae
WHY DENOTATIONAL?: Remarks on Applied Denotational Semantics
Fundamenta Informaticae
Adjunctions Between Categories Of Domains
Fundamenta Informaticae
Reasoned Assumptions And Rational Psychology
Fundamenta Informaticae
Full abstraction for nominal Scott domains
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Program extraction from nested definitions
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Response information system on oil logistics unexpected situations
Proceedings of the 2013 Grand Challenges on Modeling and Simulation Conference
Representations of Algebraic Domains and Algebraic L-domains by Information Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Largest Cartesian Closed Category of Stable Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
A Note on Finitely Derived Information Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Contexts for Algebraic Domains
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
Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Concept Formation: Rough Sets and Scott Systems
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
| Hi-index | 0.01 |