The following pages link to (Q4414525):
Displaying 21 items.
- On the complexity of typechecking top-down XML transformations (Q555775) (← links)
- Frontiers of tractability for typechecking simple XML transformations (Q878753) (← links)
- Environment classifiers (Q2942909) (← links)
- Bigraphs and transitions (Q2942911) (← links)
- The m-calculus (Q2942912) (← links)
- A generic approach to the static analysis of concurrent programs with procedures (Q2942913) (← links)
- Discovering affine equalities using random interpretation (Q2942914) (← links)
- Bitwidth aware global register allocation (Q2942915) (← links)
- Folklore confirmed (Q2942916) (← links)
- New results on the computability and complexity of points--to analysis (Q2942917) (← links)
- Incremental algorithms for dispatching in dynamically typed languages (Q2942919) (← links)
- From control effects to typed continuation passing (Q2942920) (← links)
- Coercive subtyping for the calculus of constructions (Q2942921) (← links)
- A type theory for memory allocation and data layout (Q2942924) (← links)
- Static prediction of heap space usage for first-order functional programs (Q2942925) (← links)
- Ownership types for object encapsulation (Q2942927) (← links)
- Guarded recursive datatype constructors (Q2942928) (← links)
- A type system for higher-order modules (Q2942929) (← links)
- Pure patterns type systems (Q2942930) (← links)
- Enumeration for FO Queries over Nowhere Dense Graphs (Q5889796) (← links)
- Efficient algorithms for isomorphisms of simple types (Q5892119) (← links)
