518 search results - page 28 / 104 » Automating Proofs in Category Theory |
162
click to vote
TPHOL
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract. We give an overview of Agda, the latest in a series of dependently typed programming languages developed in Gothenburg. Agda is based on Martin-L¨of’s intuitionistic t...
115
Voted
LICS
2010
IEEE
14 years 9 months ago
2010
IEEE
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
204
click to vote
POPL
2004
ACM
16 years 1 days ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
TPHOL
2002
IEEE
15 years 4 months ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
LICS
1990
IEEE
15 years 3 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...