POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Kernel Andorra Prolog and its computation model
Logic programming
Concurrent constraint programming
Concurrent constraint programming
Object-oriented type systems
Closure analysis in constraint form
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constraint-based array dependence analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Type inference with constrained types
Theory and Practice of Object Systems - Special issue on foundations of object-oriented languages
Introduction to set constraint-based program analysis
Science of Computer Programming
Points-to analysis for Java using annotated constraints
OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Proof Search in the Intuitionistic Sequent Calculus
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
A Hyperdoctrinal View of Concurrent Constraint Programming
Proceedings of the REX Workshop on Sematics: Foundations and Applications
A new framework for declarative programming
Theoretical Computer Science
Constraint Logic Programming with Hereditary Harrop formulas
Theory and Practice of Logic Programming
Providing declarative semantics for HH extended constraint logic programs
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Advanced refactorings in eclipse
OOPSLA '04 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Automated soundness proofs for dataflow analyses and transformations via local rules
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Monadic concurrent linear logic programming
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Polyglot: an extensible compiler framework for Java
CC'03 Proceedings of the 12th international conference on Compiler construction
A Logical Characterization of Forward and Backward Chaining in the Inverse Method
Journal of Automated Reasoning
Constrained types for object-oriented languages
Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Algorithmic specifications in linear logic with subexponentials
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Focusing and polarization in linear, intuitionistic, and classical logics
Theoretical Computer Science
Higher-order logic programming languages with constraints: a semantics
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Logical approximation for program analysis
Higher-Order and Symbolic Computation
From proofs to focused proofs: a modular proof of focalization in linear logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Focusing and polarization in intuitionistic logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Hi-index | 0.00 |
We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programming (CCP, [Sar93]) as a fragment of (intuitionistic, higher-order) logic. This combination is motivated by the need for a simple executable, logical presentation for static and dynamic semantics of modern programming languages. The power of HH formulas is needed for higher-order abstract syntax, and the power of constraints is needed to naturally abstract the underlying domain of computation. Underpinning the combination is a sound and complete operational interpretation of a two-sided sequent presentation of (a large fragment of) intuitionistic logic in terms of behavioral testing of concurrent systems. Formulas on the left hand side of a sequent style presentation are viewed as a system of concurrent agents, and formulas on the right hand side as tests against this evolving system. The language permits recursive definitions of agents and tests, allows tests to augment the system being tested and allows agents to be contingent on the success of a test. We present a condition on proofs, operational derivability (OD), and show that the operational semantics generates only operationally derivable proofs. We show that a sequent in this logic has a proof iff it has an operationally derivable proof.