Sciweavers

544 search results - page 94 / 109
» The Algebra of Equality Proofs
Sort
View
ENTCS
2007
100views more  ENTCS 2007»
13 years 8 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
ENTCS
2002
128views more  ENTCS 2002»
13 years 7 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
MOC
2002
113views more  MOC 2002»
13 years 7 months ago
Computation of several cyclotomic Swan subgroups
Let Cl(OK [G]) denote the locally free class group, that is the group of stable isomorphism classes of locally free OK [G]-modules, where OK is the ring of algebraic integers in th...
Timothy Kohl, Daniel R. Replogle
IANDC
2010
151views more  IANDC 2010»
13 years 6 months ago
Complete sets of cooperations
The structure map turning a set into the carrier of a final coalgebra is not unique. This fact is well-known but commonly elided. In this paper we argue that any such concrete re...
Clemens Kupke, Jan J. M. M. Rutten
JACM
2010
116views more  JACM 2010»
13 years 6 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára