Sciweavers

283 search results - page 39 / 57
» Functional Pearls: Probabilistic functional programming in H...
Sort
View
ICLP
2010
Springer
15 years 5 months ago
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
Fabrizio Riguzzi, Terrance Swift
POPL
2003
ACM
16 years 1 months ago
Guarded recursive datatype constructors
We introduce a notion of guarded recursive (g.r.) datatype constructors, generalizing the notion of recursive datatypes in functional programming languages such as ML and Haskell....
Hongwei Xi, Chiyan Chen, Gang Chen
PEPM
2010
ACM
15 years 10 months ago
Making "stricterness" more relevant
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
Stefan Holdermans, Jurriaan Hage
PPPJ
2003
ACM
15 years 6 months ago
A new approach for implementing stand-alone and Web-based interpreters for Java
Compared to imperative programming languages like Pascal or Basic, or functional programming languages like ML or Haskell learning Java is hampered by the fact that to get even th...
Stephan Diehl, Claudia Bieg
APAL
2008
90views more  APAL 2008»
15 years 1 months ago
On the unity of duality
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....
Noam Zeilberger