3572 search results - page 516 / 715 » Nominal Logic Programming |
141
click to vote
TLDI
2005
ACM
15 years 10 months ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
167
click to vote
CCS
2005
ACM
15 years 10 months ago
2005
ACM
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
226
Voted
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
123
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
160
click to vote
EUSFLAT
2009
15 years 2 months ago
2009
Abstract-- In this paper, we deal with the production and transportation planning of a household appliances manufacturer that has production facilities and central stores for resel...