831 search results - page 63 / 167 » Coalgebraic Correspondence Theory |
TLCA
2007
Springer
15 years 6 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
TLDI
2009
ACM
15 years 8 months ago
2009
ACM
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
100
click to vote
LPAR
2007
Springer
15 years 6 months ago
2007
Springer
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
SMI
2005
IEEE
15 years 5 months ago
2005
IEEE
We present an approach to hierarchically encode the topology of functions over triangulated surfaces. We describe the topology of a function by its Morse-Smale complex, a well kno...
DESRIST
2009
Springer
15 years 4 months ago
2009
Springer
An approach to instructional design is described which avoids some of the problems traditionally associated with process design models, sometimes referred to as waterfall models. ...