5506 search results - page 88 / 1102 » Minimal Logic Programs |
ICFP
2008
ACM
16 years 23 days ago
2008
ACM
There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof assistants in order to capture in the types impo...
109
Voted
DDECS
2008
IEEE
15 years 7 months ago
2008
IEEE
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
90
Voted
CSCW
2000
ACM
15 years 5 months ago
2000
ACM
In general, collaboration infrastructures have supported sharing of an object based on its logical structure. However, current implementations assume an implicit binding between t...
123
Voted
TPHOL
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract. This pearl examines how to verify functional programs written using the state monad. It uses Coq’s Program framework to provide strong specifications for the standard ...
ICCAD
2005
IEEE
15 years 9 months ago
2005
IEEE
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...