57 search results - page 10 / 12 » A Monadic Formalization of ML5 |
187
click to vote
TPHOL
2008
IEEE
16 years 25 days 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...
187
click to vote
ICALP
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
187
click to vote
TLCA
2007
Springer
16 years 17 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...
196
click to vote
PLDI
2006
ACM
16 years 13 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...
136
click to vote
ENTCS
2007
15 years 6 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...