The following pages link to New Computational Paradigms (Q5717056):
Displaying 9 items.
- A constructive analysis of learning in Peano arithmetic (Q450942) (← links)
- Non-determinism in Gödel's system \(T\) (Q693050) (← links)
- A domain model characterising strong normalisation (Q958484) (← links)
- Continuous normalization for the lambda-calculus and Gödel's T (Q1772771) (← links)
- Strong normalization in type systems: A model theoretical approach (Q1891251) (← links)
- Breaking through the normalization barrier: a self-interpreter for F-omega (Q2828238) (← links)
- On completeness of reducibility candidates as a semantics of strong normalization (Q2881069) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- Constructive Mathematics and Functional Programming (Abstract) (Q5458392) (← links)