scientific article; zbMATH DE number 1158760
From MaRDI portal
Publication:4391451
zbMath0900.68129MaRDI QIDQ4391451
Gopalan Nadathur, Dale A. Miller
Publication date: 3 June 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
From axioms to synthetic inference rules via focusing ⋮ Higher-order unification via combinators ⋮ The Qu-Prolog unification algorithm: formalisation and correctness ⋮ Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis ⋮ A game semantics for disjunctive logic programming ⋮ The intricacies of three-valued extensional semantics for higher-order logic programs ⋮ Constraint handling rules with binders, patterns and generic quantification ⋮ A new framework for declarative programming ⋮ Semantics of structured normal logic programs ⋮ A semantic framework for open processes ⋮ A concurrent constraint programming interpretation of access permissions ⋮ Equivalence of two fixed-point semantics for definitional higher-order logic programs ⋮ Kripke semantics for higher-order type theory applied to constraint logic programming languages ⋮ Universal algebra in higher types ⋮ Unification under a mixed prefix ⋮ Higher-order unification revisited: Complete sets of transformations ⋮ Mechanized metatheory revisited ⋮ Proof-search in type-theoretic languages: An introduction ⋮ Clausal logic and logic programming in algebraic domains ⋮ Subset-equational programming in intelligent decision systems
This page was built for publication:
