Sciweavers

26 search results - page 2 / 6
» Strong normalization property for second order linear logic
Sort
View
IFIP
2004
Springer
13 years 10 months ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack
PLANX
2007
13 years 6 months ago
XML Transformation Language Based on Monadic Second Order Logic
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
Kazuhiro Inaba, Haruo Hosoya
BIRTHDAY
2005
Springer
13 years 10 months ago
Reduction Strategies for Left-Linear Term Rewriting Systems
Huet and L´evy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a de...
Yoshihito Toyama
SIAMCO
2002
78views more  SIAMCO 2002»
13 years 4 months ago
Strong Optimality for a Bang-Bang Trajectory
In this paper we give sufficient conditions for a bang-bang regular extremal to be a strong local optimum for a control problem in the Mayer form; strong means that we consider the...
Andrei A. Agrachev, Gianna Stefani, PierLuigi Zezz...
CADE
2005
Springer
14 years 5 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau