<--- Back to Details
First PageDocument Content
Curry–Howard correspondence / Dependently typed programming / Logic in computer science / Philosophy of computer science / Proof theory / Type theory / Visitor pattern / Fixed-point combinator / Lambda calculus / Theoretical computer science / Computer science / Mathematics
Date: 2005-11-16 08:41:24
Curry–Howard correspondence
Dependently typed programming
Logic in computer science
Philosophy of computer science
Proof theory
Type theory
Visitor pattern
Fixed-point combinator
Lambda calculus
Theoretical computer science
Computer science
Mathematics

Add to Reading List

Source URL: www.cs.bham.ac.uk

Download Document from Source Website

File Size: 298,64 KB

Share Document on Facebook

Similar Documents

Logic and programming The Temporal Curry–Howard Correspondence Conclusions and outlook

DocID: 1t3Gc - View Document

Dependently typed programming / Philosophy of computer science / Type theory / Proof theory / Ordinal numbers / Curry–Howard correspondence

INSTRUCTIONS FOR PRODUCING A CAMERA-READY MANUSCRIPT A.B. AUTHOR Department of Physics, Theoretical Physics, 1 Keble Road, Oxford OX1 3NP, England This is where the abstract should be placed. It should consist of one pa

DocID: 1gnrI - View Document

Propositional calculus / Proof theory / Logic in computer science / Boolean algebra / Formal systems / Natural deduction / Curry–Howard correspondence / Sequent calculus / Frege system / Logic / Mathematical logic / Mathematics

Unbounded Proof-Length Speed-up in Deduction Modulo Guillaume Burel1 1 Universit´e Henri Poincar´e & LORIA2

DocID: 1ggFx - View Document

Type theory / Models of computation / Symbol / Lambda calculus / Greek alphabet / Type constructor / Curry–Howard correspondence / Normalisation by evaluation / Theoretical computer science / Mathematics / Computer science

Self-Representation in Girard’s System U Keywords Lambda Calculus; Self Representation; Types 1.

DocID: 1g42s - View Document

Logic / Computability theory / Curry–Howard correspondence / Logic in computer science / Philosophy of computer science / Type theory / Symbol / Mathematical logic / Mathematics / Proof theory

Jordan Journal of Mathematics and Statistics (JJMS) 3(3), 2010, ppAN EXTENSION OF MULHOLLAND’S INEQUALITY BICHENG YANG Abstract. By introducing multi-parameters and using the way of weight coefficients and

DocID: 1g1O8 - View Document