Publication:4023825

No author found.

Publication date: 23 January 1993

modal logic; abstract data types; finite structures; Mathematical structures; Logic computer science; semantics of a functional programming language; valuation systems

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science

03B45: Modal logic (including the logic of norms)

68N15: Theory of programming languages

03B70: Logic in computer science

68N17: Logic programming

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

Related Items

Regular database update logics, Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem, Objects and their lambda calculus, On interreduction of semi-complete term rewriting systems, Implementing conditional term rewriting by graph rewriting, Proof by computation in the Coq system, Weak normalization implies strong normalization in a class of non-dependent pure type systems, On the longest perpetual reductions in orthogonal expression reduction systems, Higher-order subtyping and its decidability, Strong normalisation in the \(\pi\)-calculus, Basic notions of universal algebra for language theory and graph grammars, A sequential reduction strategy, On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems, Lazy narrowing: strong completeness and eager variable elimination, Duality beyond sober spaces: Topological spaces and observation frames, A faithful computational model of the real numbers, Modular termination of \(r\)-consistent and left-linear term rewriting systems, The meaning of specifications I: Domains and initial models, Term rewriting and Hoare logic -- Coded rewriting, On fuzzy type theory, Theory revision with queries: Horn, read-once, and parity formulas, Tree algebras and varieties of tree languages, Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters, Meadows and the equational specification of division, Higher-order rewrite systems and their confluence, Bubbles in modularity, Generalized metric spaces: Completion, topology, and powerdomains via the Yoneda embedding, Polymorphic syntax definition, Reasoning about nondeterministic and concurrent actions: A process algebra approach, Typability and type checking in System F are equivalent and undecidable, On \(\Pi\)-conversion in the \(\lambda\)-cube and the combination with abbreviations, Combinatory reduction systems: Introduction and survey, Modularity of confluence: A simplified proof, Confluence by decreasing diagrams, \(F\)-semantics for type assignment systems, On the modularity of termination of term rewriting systems, Comparing cubes of typed and type assignment systems, A useful \(\lambda\)-notation, Incremental constraint satisfaction for equational logic programming, Lambda calculus with explicit recursion, Specification of abstract dynamic-data types: A temporal logic approach, Simple termination of rewrite systems, A linear logical framework, Typed operational semantics for higher-order subtyping., Constraint contextual rewriting., Binary decision diagrams for first-order predicate logic., Recursive quasi-metric spaces., On normalizing, non-terminating one-rule string rewriting systems, Comparing logics for rewriting: Rewriting logic, action calculi and tile logic, Globalization of confluent partial actions on topological and metric spaces, Algebraic models of microprocessors architecture and organisation, Skew confluence and the lambda calculus with letrec, Bisimilarity in term graph rewriting., The combinator S, Integration in Real PCF, Perpetuality and uniform normalization in orthogonal rewrite systems, Extension of valuations on locally compact sober spaces, A constructive approach to nonstandard analysis, Formalism and method, Logicality of conditional rewrite systems, A survey of strategies in rule-based program transformation systems, Evaluation strategies for functional logic programming, Decidability of bounded higher-order unification, On the computational content of the Lawson topology, The constructive maximal point space and partial metrizability, The conflict-free reduction geometry, In the Search of a Naive Type Theory