The following pages link to (Q3999206):
Displaying 50 items.
- Representations of algebraic domains and algebraic L-domains by information systems (Q276406) (← links)
- Deciding safety and liveness in TPTL (Q402360) (← links)
- Space-efficient path-reporting approximate distance oracles (Q517013) (← links)
- Preface to the special volume (Q534064) (← links)
- On cool congruence formats for weak bisimulations (Q549196) (← links)
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- A note on ``Extensional PERs'' (Q615886) (← links)
- Recursive definitions and fixed-points on well-founded structures (Q654910) (← links)
- Metric temporal logic with durations (Q673880) (← links)
- Two models of synthetic domain theory (Q678839) (← links)
- Tail recursion through universal invariants (Q685396) (← links)
- On stable domains (Q685428) (← links)
- The probabilistic powerdomain for stably compact spaces (Q703479) (← links)
- A computational method for inferring growth parameters and shape changes during development based on clonal analysis (Q776468) (← links)
- Generalised information systems capture L-domains (Q831140) (← links)
- Innovations in computational type theory using Nuprl (Q865639) (← links)
- Permutative rewriting and unification (Q876048) (← links)
- Unique parallel decomposition in branching and weak bisimulation semantics (Q896916) (← links)
- A representation of L-domains by information systems (Q896923) (← links)
- Learning recursive functions: A survey (Q924164) (← links)
- On finite alphabets and infinite bases (Q924717) (← links)
- On model checking multiple hybrid views (Q947781) (← links)
- Information systems revisited -- the general continuous case (Q949623) (← links)
- 3-valued abstraction: More precision at less cost (Q958307) (← links)
- Verification of qualitative \(\mathbb Z\) constraints (Q959820) (← links)
- Resolution-based approach to compatibility analysis of interacting automata (Q1127549) (← links)
- Programming in metric temporal logic (Q1128978) (← links)
- Observational structures and their logic (Q1190494) (← links)
- New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic (Q1193588) (← links)
- Extensional PERs (Q1193589) (← links)
- Well rewrite orderings and well quasi-orderings (Q1209622) (← links)
- The first-order theory of linear one-step rewriting is undecidable (Q1275021) (← links)
- Set constraints and automata (Q1286366) (← links)
- Properly injective spaces and function spaces (Q1295213) (← links)
- Uniform approximation of topological spaces (Q1295362) (← links)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
- Computational adequacy of the FIX-logic (Q1349677) (← links)
- Semantic data modelling using linear logic (Q1349996) (← links)
- Current trends in geometric modeling and selected computational applications (Q1377890) (← links)
- No NP problems averaging over ranking of distributions are harder (Q1391309) (← links)
- Avoiding slack variables in the solving of linear diophantine equations and inequations (Q1391934) (← links)
- Decision algorithms for multiplayer noncooperative games of incomplete information (Q1609052) (← links)
- Incorporating quotation and evaluation into Church's type theory (Q1753993) (← links)
- CCS with Hennessy's merge has no finite-equational axiomatization (Q1763725) (← links)
- The synthesis of language learners. (Q1854290) (← links)
- Basic theory of \(F\)-bounded quantification. (Q1854309) (← links)
- Games and full abstraction for FPC. (Q1854351) (← links)
- Full abstraction for PCF (Q1854394) (← links)
- Tarskian set constraints (Q1854523) (← links)
- On completeness and cocompleteness in and around small categories (Q1896485) (← links)
