Pages that link to "Item:Q1101251"
From MaRDI portal
The following pages link to Proving termination of normalization functions for conditional expressions (Q1101251):
Displaying 5 items.
- Normalising the associative law: An experiment with Martin-Löf's type theory (Q809071) (← links)
- Constructing recursion operators in intuitionistic type theory (Q1094421) (← links)
- Synthesis of ML programs in the system Coq (Q1322847) (← links)
- On proving the termination of algorithms by machine (Q1341666) (← links)
- Representing inductively defined sets by wellorderings in Martin-Löf's type theory (Q1392287) (← links)
