scientific article; zbMATH DE number 784358
computabilitydecidabilityequational logicfunctional programminglambda-calculuslogic programmingmodularitynatural deductionreductionresolutionrewriting systemssemantics of computation
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Equational classes, universal algebra in model theory (03C05) Basic properties of first-order languages and structures (03C07) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) General topics in the theory of software (68N01) Logic programming (68N17) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)
- A fuzzy language.
- Using well-founded relations for proving operational termination
- A proof-theoretic foundation of abortive continuations
- Confluence theory for graphs
- The length of an intersection
- scientific article; zbMATH DE number 5029307 (Why is no real title available?)
- A new proposal of concurrent process calculus
- Mechanized formal methods: progress and prospects
- Fundamentals of context-sensitive rewriting
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 Q4843402)
