56 search results - page 1 / 12 » Implementing Parameterized Type Algorithm Definitions in Mat... |
SYNASC
2006
IEEE
13 years 10 months ago
2006
IEEE
The paper focuses on means of defining parameterized type categories and algorithms built on such types in Mathematica. Symbolic algorithms based on category theory have the advan...
ENTCS
2008
13 years 4 months ago
2008
An algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterized type definitions is presented. The algorithm generalizes previous...
JSC
2008
13 years 4 months ago
2008
Abstract. Flat theory with sequence variables and flexible arity symbols has infinitary matching and unification type. Decidability of general unification is shown and a unificatio...
POPL
1997
ACM
13 years 8 months ago
1997
ACM
Java offers the real possibility that most programs can be written in a type-safe language. However, for Java to be broadly useful, it needs additional expressive power. This pape...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...