Sciweavers

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

297

Voted

LCC
1994

193views Algorithms» more LCC 1994»

Expressing Computational Complexity in Constructive Type Theory

15 years 11 months ago

Expressing Computational Complexity in Constructive Type Theory

Download ce.sharif.edu

Robert L. Constable

Real-time Traffic

Algorithms | LCC 1994 |

claim paper

Related Content

» Formalising Exact Arithmetic in Type Theory

» Productivity of EdalatPotts Exact Arithmetic in Constructive Type Theory

» Applications of Kolmogorov complexity to computable model theory

» Embedding Pure Type Systems in the LambdaPiCalculus Modulo

» Type Theory and Functional Programming

» Transcriptional regulatory network refinement and quantification through kinetic modeling ...

» Descriptive Complexity of Finite Abelian Groups

» Typed Abstraction of Complex Network Compositions

» Verifying haskell programs using constructive type theory

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1994
Where	LCC
Authors	Robert L. Constable

Comments (0)