2236 search results - page 158 / 448 » Language Independence and Language Tolerance in Logic Progra... |
166
click to vote
APLAS
2004
ACM
2004
ACM
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
15 years 12 months ago
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
282
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
187
click to vote
ENTCS
2007
15 years 6 months ago
2007
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
147
click to vote
TOOLS
1999
IEEE
15 years 10 months ago
1999
IEEE
The Unified Modeling Language (UML) is a set of notations for modelling object-oriented systems. It has become the de facto standard. Most of its notations are diagrammatic. An ex...
188
click to vote
ERLANG
2003
ACM
15 years 11 months ago
2003
ACM
In this paper, some experiences of using the concurrent functional language Erlang to implement a classical vertical application, a risk management information system, are present...