Sciweavers

169 search results - page 8 / 34
» A type system for well-founded recursion
Sort
View
APLAS
2010
ACM
13 years 7 months ago
A Certified Implementation of ML with Structural Polymorphism
Abstract. The type system of Objective Caml has many unique features, which make ensuring the correctness of its implementation difficult. One of these features is structurally pol...
Jacques Garrigue
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
13 years 7 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
CORR
2010
Springer
84views Education» more  CORR 2010»
13 years 5 months ago
Termination Casts: A Flexible Approach to Termination with General Recursion
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...
Aaron Stump, Vilhelm Sjöberg, Stephanie Weiri...
RTA
1995
Springer
13 years 11 months ago
(Head-) Normalization of Typeable Rewrite Systems
In this paper we study normalization properties of rewrite systems that are typeable using intersection types with and with sorts. We prove two normalization properties of typeable...
Steffen van Bakel, Maribel Fernández
CDC
2008
IEEE
148views Control Systems» more  CDC 2008»
14 years 2 months ago
Recursive state estimation for linear systems with mixed stochastic and set-bounded disturbances
Abstract— Recursive state estimation is considered for discrete time linear systems with mixed process and measurement disturbances that have stochastic and (convex) set-bounded ...
Toivo Henningsson