Pages that link to "Item:Q4404415"
From MaRDI portal
The following pages link to Inductive methods for proving properties of programs (Q4404415):
Displaying 28 items.
- Implementation of data types by algebraic methods (Q792753) (← links)
- Some equivalent transformations of recursive programs based on their schematic properties (Q794422) (← links)
- Acceptable functional programming systems (Q1061487) (← links)
- A theory for nondeterminism, parallelism, communication, and concurrency (Q1081296) (← links)
- On merging software extensions (Q1082067) (← links)
- Un modello di \(\lambda\)-calcolo fortemente equivalente agli schemi ricorsivi (Q1213299) (← links)
- Program schemata and the first-order decision problem (Q1213300) (← links)
- Deriving graphs from graphs by applying a production (Q1215276) (← links)
- Program equivalence and context-free grammars (Q1221492) (← links)
- Completeness results for the equivalence of recursive schemas (Q1232171) (← links)
- Least fixed points revisited (Q1234588) (← links)
- Relationships between classes of monotonic functions (Q1235976) (← links)
- On the completeness of the inductive assertion method (Q1236426) (← links)
- Backtracking in recursive computations (Q1238623) (← links)
- IO and OI. I (Q1241985) (← links)
- IO and OI. II (Q1243578) (← links)
- On an equivalence between continuation and stack semantics (Q1247741) (← links)
- A mechanical proof of the termination of Takeuchi's function (Q1259437) (← links)
- On proving the termination of algorithms by machine (Q1341666) (← links)
- Sulla computazione di funzioni ricorsive (Q1844080) (← links)
- Modular semantics for a UML statechart diagrams kernel and its extension to multicharts and branching time model-checking (Q1858428) (← links)
- A class of functions synthesized from a finite number of examples and a lisp program scheme (Q3863043) (← links)
- Recursive converters on a memory (Q3885193) (← links)
- Current methods for proving program correctness (Q3911363) (← links)
- Transformations predefining a program (Q3915999) (← links)
- (Q4139645) (← links)
- (Q5089296) (← links)
- On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics (Q5097622) (← links)
