The following pages link to (Q4023900):
Displayed 50 items.
- Some characteristics of strong innermost normalization (Q1575274) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- Symbolic model checking for \(\mu\)-calculus requires exponential time (Q1575656) (← links)
- On the intuitionistic force of classical search (Q1575923) (← links)
- Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
- On principal types of combinators (Q1583260) (← links)
- Universal coalgebra: A theory of systems (Q1583483) (← links)
- Decidable fragments of first-order temporal logics (Q1591203) (← links)
- On the Yoneda completion of a quasi-metric space (Q1605178) (← links)
- Soundness of data refinement for a higher-order imperative language (Q1605184) (← links)
- Real number computation through Gray code embedding. (Q1607300) (← links)
- Relating conflict-free stable transition and event models via redex families (Q1608893) (← links)
- The Church-Rosser theorem and quantitative analysis of witnesses (Q1627965) (← links)
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case (Q1764799) (← links)
- Two-level languages for program optimization (Q1826626) (← links)
- A category of compositional domain-models for separable Stone spaces. (Q1853606) (← links)
- Normalization, approximation, and semantics for combinator systems (Q1853619) (← links)
- The combinator S (Q1854346) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- Generated quasi-metric hyper and function spaces. (Q1868863) (← links)
- Finding direct partition bijections by two-directional rewriting techniques (Q1877658) (← links)
- Nominal unification (Q1882909) (← links)
- Variants of the basic calculus of constructions (Q1885480) (← links)
- Intersection types for explicit substitutions (Q1887145) (← links)
- The data type variety of stack algebras (Q1891249) (← links)
- Constructing a quasi-uniform function space (Q1903595) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- Logicality of conditional rewrite systems (Q1978646) (← links)
- A duality for two-sorted lattices (Q2156992) (← links)
- Partial arithmetical data types of rational numbers and their equational specification (Q2168794) (← links)
- Some topological notations via Maki's \(\Lambda \)-sets (Q2187056) (← links)
- Program schemata technique for propositional program logics: a 30-year history (Q2216719) (← links)
- Formalization of universal algebra in Agda (Q2333322) (← links)
- A new way to extend t-norms, t-conorms and negations (Q2351613) (← links)
- Semantics of a sequential language for exact real-number computation (Q2373708) (← links)
- Ultraproducts and possible worlds semantics in institutions (Q2373712) (← links)
- Recursively defined metric spaces without contraction (Q2373743) (← links)
- On confluence and residuals in Cauchy convergent transfinite rewriting (Q2390300) (← links)
- Algebraic models of behaviour and correctness of SMT and CMT processors (Q2461762) (← links)
- A new generalization of contra-continuity via Levine's \(g\)-closed sets (Q2466670) (← links)
- Symbolic protocol analysis for monoidal equational theories (Q2482449) (← links)
- On modularity in infinitary term rewriting (Q2496298) (← links)
- Investigations on the dual calculus (Q2503329) (← links)
- Shallow confluence of conditional term rewriting systems (Q2518609) (← links)
- Containers: Constructing strictly positive types (Q2566024) (← links)
- An axiomatization of PCTL* (Q2566222) (← links)
- Probabilistic temporal logics via the modal mu-calculus (Q2566296) (← links)
- Declarative Debugging of Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Accóon Integrada Hispano-Italiana HI2000-0161 and by Generalitat Valenciana under grant GV01-424. (Q2841221) (← links)
- A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenci (Q2841284) (← links)
- An Abstract Decision Procedure for Satisfiability in the Theory of Recursive Data Types (Q2864522) (← links)