Calculus Of Constructions

The Calculus of Constructions (CoC) is a higher-order typed lambda calculus where types are first-class values. It is thus possible, within the CoC, to define functions from, say, integers to types, types to types as well as functions from integers to integers. The CoC is strongly normalizing. The CoC was initially developed by Thierry Coquand. The CoC was the basis of the early versions of the Coq theorem prover; later versions were built upon the Calculus of Inductive Constructions an extension of CoC with native support for inductive datatypes. In the original CoC, inductive datatypes had to be emulated as their polymorphic destructor function.

 

<< PreviousWord BrowserNext >>
matthew good
union of right forces
steve adler
garter snake
height gauge
william s. sessions
republic of venice
distributive writing
dave desroches
monsieur
win a date with tad hamilton!
krishnamurti
bernardino de sahagn
grumman g 21
pilate (band)
north by northeast
rajinikanth
leonardo ciampa
latvian parliamentary election, 1995
spike timing dependent plasticity
agreement of friendship, cooperation, and mutual assistance
virginia zeani
1952 in science
port macquarie, new south wales
grigory kulik
maplemusic recordings
broadcast operations group
emperor huizong of song china
ezra sims
joseph maneri
grand trunk pacific railway
south cadbury
1950 in science
build
kathleen edwards
1949 in science
1948 in science
united nations intelligence taskforce
the amtrak wars
laoshan
1947 in science
qingzhou
weifang
the weakerthans