52 search results - page 5 / 11 » Some Grammatical Structures of Programming Languages as Simp... |
POPL
2006
ACM
14 years 9 months ago
2006
ACM
We offer a solution to the type inference problem for an extension of Hindley and Milner's type system with generalized algebraic data types. Our approach is in two strata. T...
ICALP
1998
Springer
14 years 1 months ago
1998
Springer
In the seventies, several classification schemes for the rational languages were proposed, based on the alternate use of certain operators (union, complementation, product and star...
IJCAI
2003
13 years 10 months ago
2003
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
POPL
2008
ACM
14 years 9 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
TLDI
2003
ACM
14 years 2 months ago
2003
ACM
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...