Sciweavers

1828 search results - page 58 / 366
» First-Class Type Classes
Sort
View
LICS
2010
IEEE
15 years 28 days ago
Equality Is Typable in Semi-full Pure Type Systems
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
Vincent Siles, Hugo Herbelin
ECOOP
2000
Springer
15 years 6 months ago
Ionic Types
Abstract. We are interested in the class of systems for which the satisfaction of code dependencies is a dynamic process rather than one which is determined purely at load-time. Ex...
Simon A. Dobson, Brian Matthews
105
Voted
CSR
2010
Springer
15 years 5 months ago
Sofic and Almost of Finite Type Tree-Shifts
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...
Nathalie Aubrun, Marie-Pierre Béal
134
Voted
ENTCS
2007
92views more  ENTCS 2007»
15 years 2 months ago
A Duality in Proof Systems for Recursive Type Equality and for Bisimulation Equivalence on Cyclic Term Graphs
This paper is concerned with a proof-theoretic observation about two kinds of proof systems for regular cyclic objects. It is presented for the case of two formal systems that are...
Clemens Grabmayer
126
Voted
EJC
2011
14 years 9 months ago
Enumeration of connected Catalan objects by type
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product f...
Brendon Rhoades