Sciweavers

4757 search results - page 429 / 952
» Monads for Functional Programming
Sort
View
POPL
2012
ACM
14 years 2 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
WWW
2008
ACM
16 years 7 months ago
Better abstractions for secure server-side scripting
bstractions for Secure Server-Side Scripting Dachuan Yu Ajay Chander Hiroshi Inamura Igor Serikov DoCoMo Communications Laboratories USA 3240 Hillview Avenue Palo Alto, CA 94304 {y...
Dachuan Yu, Ajay Chander, Hiroshi Inamura, Igor Se...
POPL
2007
ACM
16 years 7 months ago
A very modal model of a modern, major, general type system
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
Andrew W. Appel, Christopher D. Richards, Jé...
GECCO
2004
Springer
16 years 6 days ago
Improving Generalisation Performance Through Multiobjective Parsimony Enforcement
This paper describes POPE-GP, a system that makes use of the NSGA-II multiobjective evolutionary algorithm as an alternative, parameter-free technique for eliminating program bloat...
Yaniv Bernstein, Xiaodong Li, Victor Ciesielski, A...
IFL
2004
Springer
122views Formal Methods» more  IFL 2004»
16 years 5 days ago
Source-Based Trace Exploration
Abstract. Tracing a computation is a key method for program comprehension and debugging. Hat is a tracing system for Haskell 98 programs. During a computation a trace is recorded i...
Olaf Chitil