Sciweavers

280 search results - page 32 / 56
» Equivalence of Two Formal Semantics for Functional Logic Pro...
Sort
View
POPL
1994
ACM
14 years 12 hour ago
Formally Optimal Boxing
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
Fritz Henglein, Jesper Jørgensen
JACM
2010
137views more  JACM 2010»
13 years 6 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
POPL
2007
ACM
14 years 8 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é...
FSTTCS
1999
Springer
14 years 6 days ago
Hoare Logic for Mutual Recursion and Local Variables
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
David von Oheimb
ESOP
2003
Springer
14 years 1 months ago
A Tail-Recursive Semantics for Stack Inspections
Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy. An implementation of such a language may ha...
John Clements, Matthias Felleisen