scientific article; zbMATH DE number 108365
From MaRDI portal
Publication:4023825
abstract data typesfinite structuresLogic computer scienceMathematical structuresmodal logicsemantics of a functional programming languagevaluation systems
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of programming languages (68N15) Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Symbolic computation and algebraic computation (68W30)
Recommendations
Cited in
(only showing first 100 items - show all)- Meadows and the equational specification of division
- Operational domain theory and topology of sequential programming languages
- A hybrid programming scheme combining fuzzy-logic and functional-logic resources
- Strong normalization property for second order linear logic
- Vivid: a framework for heterogeneous problem solving
- Higher-order rewrite systems and their confluence
- Bubbles in modularity
- Generalized metric spaces: Completion, topology, and powerdomains via the Yoneda embedding
- Polymorphic syntax definition
- Handbook of recursive mathematics. Vol. 1: Recursive model theory
- Reasoning about nondeterministic and concurrent actions: A process algebra approach
- Typability and type checking in System F are equivalent and undecidable
- On -conversion in the -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 -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
- A type system for counting instances of software components
- 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
- The universal exponentiable arrow
- A quantitative approach to reasoning about incomplete knowledge
- Braids via term rewriting
- Rewriting-based repairing strategies for XML repositories
- Multiset rewriting over Fibonacci and tribonacci numbers
- 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
- From realizability to induction via dependent intersection
- Handbook of logic in computer science. Vol. 5: Logical and algebraic methods
- scientific article; zbMATH DE number 1705882 (Why is no real title available?)
- Evaluation strategies for functional logic programming
- Transformation of shaped nested graphs and diagrams
- Certifying term rewriting proofs in ELAN
- Timed term rewrite systems
- Defining actions in concurrent declarative programming
- Reducibility: a ubiquitous method in lambda calculus with intersection types
- Nominal equational logic
- Bridging Curry and Church's typing style
- Special topics in mathematics for computer scientists. Sets, categories, topologies and measures
- In the Search of a Naive Type Theory
- Least upper bounds on the size of Church-Rosser diagrams in term rewriting and -calculus
- Abstract reduction systems and idea of Knuth-Bendix completion algorithm
- On computable numbers, nonuniversality, and the genuine power of parallelism
- scientific article; zbMATH DE number 783754 (Why is no real title available?)
- Representations of complete uniform spaces via uniform domains
- Categorical rewriting of term-like structures
- Cut Elimination in a Class of Sequent Calculi for Pure Type Systems
- Simple termination is difficult
- Dependency pairs termination in dependent type theory modulo rewriting
- Characteristics of de Bruijn’s early proof checker Automath
- Lazy narrowing: strong completeness and eager variable elimination (extended abstract)
- Modal operators on pseudo-BE algebras
- 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
- An integrated framework for the diagnosis and correction of rule-based programs
- Monad transformers as monoid transformers
- Levels of undecidability in rewriting
- 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
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023825)
