Sciweavers

265 search results - page 34 / 53
» Lambda calculus with patterns
Sort
View
POPL
1989
ACM
15 years 3 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
IAT
2010
IEEE
14 years 9 months ago
Intention Recognition with Event Calculus Graphs
Intention recognition has significant applications in ambient intelligence, for example in assisted living and care of the elderly, in games and in intrusion and other crime detec...
Fariba Sadri
ICFP
2003
ACM
15 years 11 months ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...
AGP
1999
IEEE
15 years 4 months ago
The Relative Complement Problem for Higher-Order Patterns
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
Alberto Momigliano, Frank Pfenning
DBPL
2003
Springer
109views Database» more  DBPL 2003»
15 years 5 months ago
Modelling Dynamic Web Data
We introduce the Xdπ calculus, a peer-to-peer model for reasoning about dynamic web data. Web data is not just stored statically. Rather it is referenced indirectly, for example ...
Philippa Gardner, Sergio Maffeis