478 search results - page 45 / 96 » Monads of Regular Theories |
153
click to vote
ISSAC
2007
Springer
16 years 27 days ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
201
click to vote
TPHOL
2008
IEEE
16 years 1 months ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
201
click to vote
TLCA
2007
Springer
16 years 26 days ago
2007
Springer
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
209
Voted
PLDI
2006
ACM
16 years 22 days ago
2006
ACM
We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework...
179
click to vote
ESOP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...