Sciweavers

61 search results - page 9 / 13
» A Simple Semantics for ML Polymorphism
Sort
View
87
Voted
RULEML
2004
Springer
15 years 2 months ago
SWRLp: An XML-Based SWRL Presentation Syntax
RuleML and SWRL are closely related rule markup languages that are growing in popularity particularly within the Semantic Web community. Both are based on XML and as such are more ...
Christopher J. Matheus
TCS
2011
14 years 4 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
ESOP
2007
Springer
15 years 3 months ago
Principal Type Schemes for Modular Programs
Abstract. Two of the most prominent features of ML are its expressive module system and its support for Damas-Milner type inference. However, while the foundations of both these fe...
Derek Dreyer, Matthias Blume
74
Voted
ESOP
2009
Springer
15 years 1 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
ML
2006
ACM
103views Machine Learning» more  ML 2006»
15 years 3 months ago
Type-safe distributed programming for OCaml
Existing ML-like languages guarantee type-safety, ensuring memty and protecting the invariants of abstract types, but only within single executions of single programs. Distributed...
John Billings, Peter Sewell, Mark R. Shinwell, Rok...