The following pages link to René David (Q172779):
Displaying 50 items.
- A short proof that adding some permutation rules to \(\beta \) preserves SN (Q631758) (← links)
- Strong normalization results by translation (Q636353) (← links)
- A direct proof of the confluence of combinatory strong reduction (Q732008) (← links)
- Counting proofs in propositional logic (Q1014285) (← links)
- (Q1256453) (redirect page) (← links)
- A \(\pi^1_2\) singleton with no sharp in a generic extension of \(L^\#\) (Q1256454) (← links)
- Petri nets for modeling of dynamic systems -- a survey (Q1317176) (← links)
- A syntactical proof of the operational equivalence of two \(\lambda\)-terms (Q1390880) (← links)
- Asymptotic continuous Petri nets (Q1802241) (← links)
- Normalization without reducibility (Q1840460) (← links)
- An experiment concerning mathematical proofs on computers with French undergraduate students (Q1884267) (← links)
- A \(\lambda\)-calculus with explicit weakening and explicit substitution (Q2713357) (← links)
- Why the usual candidates of reducibility do not work for the symmetric \(\lambda\mu\)-calculus (Q2851698) (← links)
- About the range property for \(\mathcal H\) (Q2871228) (← links)
- Approximate analysis of transfer lines with unreliable machines and finite buffers (Q3031957) (← links)
- (Q3218113) (← links)
- Arithmetical proofs of strong normalization results for symmetric lambda calculi (Q3593501) (← links)
- An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types (Q3612624) (← links)
- (Q3660930) (← links)
- (Q3663155) (← links)
- A very absolute Π21 real singleton (Q3669400) (← links)
- Δ31 reals (Q3669401) (← links)
- (Q3680825) (← links)
- Signature Analysis for Multiple-Output Circuits (Q3731531) (← links)
- (Q3872444) (← links)
- Testing by Feedback Shift Register (Q3877585) (← links)
- Minimal Detecting Transition Sequences: Application to Random Testing (Q3877587) (← links)
- A result of relative consistency about the predicate WO(δ, <i>x</i>) (Q3882448) (← links)
- (Q3932638) (← links)
- (Q4004136) (← links)
- About Random Fault Detection of Combinational Networks (Q4093337) (← links)
- (Q4097281) (← links)
- Modular Design of Asynchronous Circuits Defined by Graphs (Q4145638) (← links)
- (Q4146682) (← links)
- A Totally Self-Checking 1-Out-of-3 Checker (Q4156350) (← links)
- (Q4158965) (← links)
- (Q4187741) (← links)
- (Q4194876) (← links)
- (Q4263864) (← links)
- (Q4289139) (← links)
- A short proof of the strong normalization of classical natural deduction with disjunction (Q4650284) (← links)
- (Q4657053) (← links)
- (Q4685318) (← links)
- Discrete, Continuous, and Hybrid Petri Nets (Q4827468) (← links)
- (Q4844951) (← links)
- (Q4850465) (← links)
- Storage operators and directed lambda-calculus (Q4876311) (← links)
- Asymptotically almost all \lambda-terms are strongly normalizing (Q4913764) (← links)
- Computer Science Logic (Q5292634) (← links)
- Typed Lambda Calculi and Applications (Q5704007) (← links)
