The following pages link to (Q4023825):
Displayed 50 items.
- Bridging Curry and Church's typing style (Q334149) (← links)
- Abstract reduction systems and idea of Knuth-Bendix completion algorithm (Q467811) (← links)
- Higher-order subtyping and its decidability (Q598199) (← links)
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- An integrated framework for the diagnosis and correction of rule-based programs (Q604477) (← links)
- Monad transformers as monoid transformers (Q615955) (← links)
- Levels of undecidability in rewriting (Q627134) (← links)
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- A sequential reduction strategy (Q671504) (← links)
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems (Q671506) (← links)
- Lazy narrowing: strong completeness and eager variable elimination (Q671677) (← links)
- Duality beyond sober spaces: Topological spaces and observation frames (Q671991) (← links)
- A faithful computational model of the real numbers (Q671999) (← links)
- Modular termination of \(r\)-consistent and left-linear term rewriting systems (Q672714) (← links)
- The meaning of specifications I: Domains and initial models (Q673181) (← links)
- Term rewriting and Hoare logic -- Coded rewriting (Q673226) (← links)
- On fuzzy type theory (Q703370) (← links)
- Speed-up theorems in type-2 computations using oracle Turing machines (Q733754) (← links)
- De Bruijn's weak diamond property revisited (Q740482) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- Tree algebras and varieties of tree languages (Q884456) (← links)
- Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters (Q884953) (← links)
- Strategy based semantics for mobility with time and access permissions (Q890480) (← links)
- Programming with narrowing: a tutorial (Q968524) (← links)
- Typing termination in a higher-order concurrent imperative language (Q979082) (← links)
- Meadows and the equational specification of division (Q1006649) (← links)
- Operational domain theory and topology of sequential programming languages (Q1013087) (← links)
- A hybrid programming scheme combining fuzzy-logic and functional-logic resources (Q1037954) (← links)
- Strong normalization property for second order linear logic (Q1044837) (← links)
- Vivid: a framework for heterogeneous problem solving (Q1045993) (← links)
- Higher-order rewrite systems and their confluence (Q1127334) (← links)
- Bubbles in modularity (Q1127335) (← links)
- Generalized metric spaces: Completion, topology, and powerdomains via the Yoneda embedding (Q1127524) (← links)
- Polymorphic syntax definition (Q1129122) (← links)
- Reasoning about nondeterministic and concurrent actions: A process algebra approach (Q1277769) (← links)
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- On \(\Pi\)-conversion in the \(\lambda\)-cube and the combination with abbreviations (Q1302298) (← links)
- Combinatory reduction systems: Introduction and survey (Q1314356) (← links)
- Modularity of confluence: A simplified proof (Q1318777) (← links)
- Confluence by decreasing diagrams (Q1322164) (← links)
- \(F\)-semantics for type assignment systems (Q1329739) (← links)
- On the modularity of termination of term rewriting systems (Q1349693) (← links)
- Comparing cubes of typed and type assignment systems (Q1365249) (← links)
- A useful \(\lambda\)-notation (Q1365680) (← links)
- Incremental constraint satisfaction for equational logic programming (Q1367535) (← links)
- Lambda calculus with explicit recursion (Q1383145) (← links)
- Specification of abstract dynamic-data types: A temporal logic approach (Q1391733) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- A linear logical framework (Q1400718) (← links)
- Typed operational semantics for higher-order subtyping. (Q1401950) (← links)