13 search results - page 2 / 3 » On Transforming Intuitionistic Matrix Proofs into Standard-S... |
144
click to vote
LOPSTR
2004
Springer
15 years 11 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
159
click to vote
CADE
1997
Springer
15 years 10 months ago
1997
Springer
We present a matrix characterization of logical validity in the multiplicative fragment of linear logic. On this basis we develop a matrix-based proof search procedure for this fra...
155
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
155
click to vote
TLCA
2007
Springer
16 years 1 days ago
2007
Springer
Abstract. The intuitionistic fragment of the call-by-name version of Curien and Herbelin’s λµ˜µ-calculus is isolated and proved strongly normalising by means of an embedding ...
120
click to vote
CDC
2008
IEEE
16 years 12 days ago
2008
IEEE
— This paper considers discrete-time periodic linear systems and their Floquet transformations, by which the periodic systems can be equivalently transformed to time-invariant on...