518 search results - page 25 / 104 » Automating Proofs in Category Theory |
112
click to vote
POPL
2012
ACM
13 years 7 months ago
2012
ACM
Despite recent successes, large-scale proof development within proof assistants remains an arcane art that is extremely timeconsuming. We argue that this can be attributed to two ...
CADE
2003
Springer
16 years 1 days ago
2003
Springer
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
FASE
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Coalgebra has in recent years been recognized as the framework of choice for the treatment of reactive systems at an appropriate level of generality. Proofs about the rea...
101
Voted
POPL
2010
ACM
15 years 9 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
157
click to vote
POPL
2007
ACM
16 years 1 days ago
2007
ACM
Future software development will rely on product synthesis, i.e., the synthesis of code and non-code artifacts for a target component or application. Prior work on feature-based p...