Inductive definitions, semantics and abstract interpretations
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PER models of subtyping, recursive types and higher-order polymorphism
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Elements of interaction: Turing award lecture
Communications of the ACM
Delimiting the scope of effects
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimization of functional programs by grammar thinning
ACM Transactions on Programming Languages and Systems (TOPLAS)
Using abstract interpretation to define a strictness type inference system
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A framework for programming denotational semantics in C++
ACM SIGPLAN Notices
The maximal VHDL subset with a cycle-level abstraction
EURO-DAC '96/EURO-VHDL '96 Proceedings of the conference on European design automation
Deciding containment for queries with complex objects (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Types as abstract interpretations
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Disjunctive program analysis for algebraic data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
Should your specification language be typed
ACM Transactions on Programming Languages and Systems (TOPLAS)
A framework for the recursive definition of data structures
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Functional and constraint logic programming
Constraints in computational logics
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Theoretical Computer Science
Pinnacles of software engineering: 25 years of formal methods
Annals of Software Engineering
Formalizing Synthetic Domain Theory
Journal of Automated Reasoning
Normalization, approximation, and semantics for combinator systems
Theoretical Computer Science
Game Semantics for Untyped lambda beta eta-Calculus
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Equivariant Syntax and Semantics
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Varieties of Programming Language Semantics
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Recursive Schema Definitions in Object-Z
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
The Varieties of Programming Language Semantics
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
A relational account of call-by-value sequentiality
Information and Computation - Special issue: LICS'97
Handbook of automated reasoning
A lattice model for data display
VIS '94 Proceedings of the conference on Visualization '94
On categories generalizing universal domains
Mathematical Structures in Computer Science
Inclusion, disjointness and choice: the logic of linguistic classification
ACL '91 Proceedings of the 29th 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
A lazy narrowing calculus for declarative constraint programming
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Theoretical Computer Science
The largest Cartesian closed category of domains, considered constructively
Mathematical Structures in Computer Science
A context-free superset approximation of unification-based grammars
New developments in parsing technology
Constructive analysis, types and exact real numbers
Mathematical Structures in Computer Science
A new generic scheme for functional logic programming with constraints
Higher-Order and Symbolic Computation
Semantics of a sequential language for exact real-number computation
Theoretical Computer Science
ACM Turing award lectures
Constraint functional logic programming over finite domains
Theory and Practice of Logic Programming
Information systems revisited – the general continuous case
Theoretical Computer Science
Abstract Interpretation from a Topological Perspective
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Generality and equivalence relations in default logic
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A sound and complete CPS-translation for λµ-calculus
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
An action semantics based on two combinators
Semantics and algebraic specification
A semantics for lazy assertions
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
Data cleaning and query answering with matching dependencies and matching functions
Proceedings of the 14th International Conference on Database Theory
Relating function spaces to resourced function spaces
Proceedings of the 2011 ACM Symposium on Applied Computing
Exploring relations between answer set programs
Logic programming, knowledge representation, and nonmonotonic reasoning
Modelling of complex software systems: a reasoned overview
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Non-sequential behaviour of dynamic nets
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Generality relations in answer set programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Axiomatic constructor classes in Isabelle/HOLCF
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Inverse-limit and topological aspects of abstract interpretation
Theoretical Computer Science
Oscillating behavior of logic programs
Correct Reasoning
From Dissemilattices to Snack Algebras
Fundamenta Informaticae
A Convex Powerdomain over Lattices: its Logic and λ-Calculus
Fundamenta Informaticae
A NOTE ON THE SMYTH POWERDOMAIN CONSTRUCTION
Fundamenta Informaticae
On quasi-metric aggregation functions and fixed point theorems
Fuzzy Sets and Systems
Representations of Algebraic Domains and Algebraic L-domains by Information Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A Domain-Theoretic Model Of Nominally-Typed Object-Oriented Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.02 |