Sciweavers

136 search results - page 25 / 28
» Typed Logical Variables in Haskell
Sort
View
ICFP
2005
ACM
14 years 7 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
ICFP
2003
ACM
14 years 7 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
ICPR
2008
IEEE
14 years 8 months ago
Incremental machine learning techniques for document layout understanding
In real-world Digital Libraries, Artificial Intelligence techniques are essential for tackling the automatic document processing task with sufficient flexibility. The great variab...
Floriana Esposito, Marenglen Biba, Stefano Ferilli...
SAGA
2005
Springer
14 years 29 days ago
Self-replication, Evolvability and Asynchronicity in Stochastic Worlds
We consider temporal aspects of self-replication and evolvability – in particular, the massively asynchronous parallel and distributed nature of living systems. Formal views of s...
Chrystopher L. Nehaniv
FORTE
1994
13 years 8 months ago
Four issues concerning the semantics of Message Flow Graphs
We discuss four issues concerning the semantics of Message Flow Graphs (MFGs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence...
Peter B. Ladkin, Stefan Leue