Sciweavers

87 search results - page 13 / 18
» Functions and Lazy Evaluation in Prolog
Sort
View
SAS
2010
Springer
134views Formal Methods» more  SAS 2010»
13 years 7 months ago
Strictness Meets Data Flow
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...
Tom Schrijvers, Alan Mycroft
ML
2008
ACM
13 years 8 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill
P2P
2006
IEEE
153views Communications» more  P2P 2006»
14 years 2 months ago
Internet-Scale Storage Systems under Churn -- A Study of the Steady-State using Markov Models
Content storage in a distributed collaborative environment uses redundancy for better resilience and thus provides good availability and durability. In a peer-to-peer environment,...
Anwitaman Datta, Karl Aberer
ICFP
2007
ACM
14 years 8 months ago
User-friendly functional programming for web mashups
MashMaker is a web-based tool that makes it easy for a normal user to create web mashups by browsing around, without needing to type, or plan in advance what they want to do. Like...
Robert Ennals, David Gay
APLAS
2009
ACM
14 years 3 months ago
Witnessing Purity, Constancy and Mutability
Restricting destructive update to values of a distinguished reference type prevents functions from being polymorphic in the mutability of their arguments. This restriction makes it...
Ben Lippmeier