Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

4

MLQ
2006

favoriteEmaildiscussreport

68views more MLQ 2006»

On the proof theory of type two functionals based on primitive recursive operations

13 years 4 months ago

On the proof theory of type two functionals based on primitive recursive operations

Download www.iam.unibe.ch

This paper is a companion to work of Feferman, J

David Steiner, Thomas Strahm

Real-time Traffic

Applicative Basis Pron | Feferman-style Applicative Theories | MLQ 2006 | Primitive Recursive Indices |

claim paper

Related Content

» Recursion on Nested Datatypes in Dependent Type Theory

» Automated Proof Construction in Type Theory Using Resolution

» Reasoning in Extensional Type Theory with Equality

» A Complete and Recursive Feature Theory

» Embedding a logical theory of constructions in Agda

» Termination Casts A Flexible Approach to Termination with General Recursion

» Map fusion for nested datatypes in intensional type theory

» Natural Semantics and Some of Its MetaTheory in Elf

» On Strong Normalization of the Calculus of Constructions with TypeBased Termination

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2006
Where	MLQ
Authors	David Steiner, Thomas Strahm

Comments (0)