The following pages link to Science of Computer Programming (Q169675):
Displaying 50 items.
- Semantics-directed generation of a Prolog compiler (Q1314540) (← links)
- Back to direct style (Q1330432) (← links)
- Dynamic typing: Syntax and proof theory (Q1330433) (← links)
- A theory of qualified types (Q1330435) (← links)
- Interprocedural type propagation for object-oriented languages (Q1330437) (← links)
- Approximate fixed points in abstract interpretation (Q1330439) (← links)
- Reversing abstract interpretations (Q1330440) (← links)
- The tensor product in Wadler's analysis of lists (Q1330441) (← links)
- Calculating path algorithms (Q1330443) (← links)
- An algebraic construction of predicate transformers (Q1330446) (← links)
- Distributing a class of sequential programs (Q1330447) (← links)
- Relational programming laws in the tree, list, bag, set hierarchy (Q1330449) (← links)
- Designing arithmetic circuits by refinement in Ruby (Q1330451) (← links)
- Operational semantics and generalized weakest preconditions (Q1330453) (← links)
- Shorter paths to graph algorithms (Q1330455) (← links)
- Authentication and delegation with smart-cards (Q1330456) (← links)
- Generating data flow analysis algorithms from modal specifications (Q1330457) (← links)
- On abstraction and the expressive power of programming languages (Q1330458) (← links)
- Programs with continuations and linear logic (Q1330460) (← links)
- Efficient parallel algorithms for tree accumulations (Q1336774) (← links)
- Static typing for object-oriented programming (Q1336775) (← links)
- Petri-net-based deadlock analysis of process algebra programs (Q1336776) (← links)
- Erratum to: Approximate fixed points in abstrat interpretation (Q1336777) (← links)
- Composition of assumption-commitment specifications in a UNITY style (Q1346680) (← links)
- Gate splitting in LOTOS specifications using abstract interpretation (Q1346681) (← links)
- Model checking using net unfoldings (Q1346682) (← links)
- Principal type schemes for functional programs with overloading and subtyping (Q1346684) (← links)
- Label algebras and exception handling (Q1346685) (← links)
- Substitution: A formal methods case study using monads and transformations (Q1346686) (← links)
- State space generation for the HAVi leader election protocol (Q1347990) (← links)
- Polytypic data conversion programs (Q1347992) (← links)
- A source of inconsistency in theories of nondeterministic functions (Q1347995) (← links)
- Timed rewriting logic with an application to object-based specification (Q1356938) (← links)
- Probabilistic models for the guarded command language (Q1356940) (← links)
- Categorical semantics of parallel program design (Q1356941) (← links)
- Formal specifications: foundations, methods, tools and applications. FMTA '95. Konstancin near Warsaw, Poland, May 29--31, 1995 (Q1363091) (← links)
- Supporting contexts in program refinement (Q1370155) (← links)
- A new approach to compiling adaptive programs (Q1370156) (← links)
- Peterson's mutual exclusion algorithm revisited (Q1370158) (← links)
- Computing with continuous change (Q1380117) (← links)
- Partial order and contextual net semantics for atomic and locally atomic CC programs (Q1380121) (← links)
- Newton: Constraint programming over nonlinear constraints (Q1380122) (← links)
- A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages (Q1380123) (← links)
- GOFFIN: Higher-order functions meet concurrent constraints (Q1380128) (← links)
- Constraint-based protocols for distributed problem solving (Q1380132) (← links)
- A distributed arc-consistency algorithm (Q1380133) (← links)
- Special issue on Concurrent constraint programming, CCP '95. 1st international workshop, University of Venice, Italy, May 29--31, 1995 (Q1380134) (← links)
- Comprehensive synchronization elimination for Java. (Q1398671) (← links)
- Infinitary relations and their representation. (Q1398672) (← links)
- Abstract interpretation of mobile ambients. (Q1398673) (← links)
