The following pages link to The programming language Pascal (Q2542188):
Displaying 30 items.
- Simple and safe SQL queries with \texttt{C++} templates (Q608241) (← links)
- FSTDS system: A fuzzy-set manipulation system (Q754633) (← links)
- Semantics of interference control (Q759473) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- Programmed deallocation without dangling reference (Q794425) (← links)
- On the classification of binding mechanisms (Q910205) (← links)
- A thread calculus with molecular dynamics (Q988554) (← links)
- A practical method for implementing string pattern matching machines (Q1193694) (← links)
- Toward a system's environment for computer assisted programming (Q1226388) (← links)
- PASCAL in LCF: Semantics and examples of proof (Q1242670) (← links)
- All structured programs have small tree width and good register allocation (Q1271620) (← links)
- Object-oriented programming in control system design: A survey (Q1333435) (← links)
- On a notational device for the description of pointer-free operations on structured data (Q1393271) (← links)
- From finite automata to fractal automata -- the power of recursion (Q2104137) (← links)
- A string diagrammatic axiomatisation of finite-state automata (Q2233427) (← links)
- Compiler to interpreter: experiences with a distributed programming language (Q2745237) (← links)
- DTL: A language for the design and implementation of concurrent programs as structured networks (Q3668842) (← links)
- Recursive converters on a memory (Q3885193) (← links)
- A simple query language based on set algebra (Q3885238) (← links)
- A practical method for reducing sparse matrices with invariant entries (Q3951588) (← links)
- An implementation base for efficient data structuring (Q4045636) (← links)
- Process synchronization in high-level languages (Q4055130) (← links)
- Aspects of compact programs and directly executed languages (Q4055133) (← links)
- Recursive data structures (Q4055171) (← links)
- A fast compactifying garbage collector (Q4114757) (← links)
- (Q4125727) (← links)
- A note on the assignment of measurement points for frequency counts in structured programs (Q4776825) (← links)
- Generalized dominators for structured programs (Q5030185) (← links)
- A note on the for statement (Q5659054) (← links)
- A Finite Axiomatisation of Finite-State Automata Using String Diagrams (Q5883739) (← links)