The following pages link to (Q5618896):
Displaying 12 items.
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- A constructive method for abstract algebraic software specification (Q796979) (← links)
- Algebraic translations, correctness and algebraic compiler construction (Q1129121) (← links)
- Algebraic processing of programming languages (Q1129126) (← links)
- More on advice on structuring compilers and proving them correct (Q1156472) (← links)
- Program morphisms (Q1203125) (← links)
- A unified language processing methodology (Q1603702) (← links)
- Types in Programming Languages, Between Modelling, Abstraction, and Correctness (Q3188252) (← links)
- Semantic preserving translations (Q4061931) (← links)
- (Q4339951) (← links)
- Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant (Q5051990) (← links)
- Getting There and Back Again (Q5074057) (← links)
