The following pages link to Automath (Q19182):
Displaying 50 items.
- Union of Reducibility Candidates for Orthogonal Constructor Rewriting (Q3507467) (← links)
- Strong normalisation in two Pure Pattern Type Systems (Q3520143) (← links)
- First Order Logic with Domain Conditions (Q3559768) (← links)
- Justification Logic and History Based Computation (Q3585058) (← links)
- Building Decision Procedures in the Calculus of Inductive Constructions (Q3608422) (← links)
- Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo (Q3612625) (← links)
- Formal Global Optimisation with Taylor Models (Q3613424) (← links)
- Dependency Tree Automata (Q3617723) (← links)
- A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance (Q3637183) (← links)
- Existential Type Systems with No Types in Terms (Q3637189) (← links)
- A Review of Mathematical Knowledge Management (Q3637281) (← links)
- Building Mathematics-Based Software Systems to Advance Science and Create Knowledge (Q3644710) (← links)
- SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi ★ (Q3647258) (← links)
- (Q3656423) (← links)
- (Q3703866) (← links)
- (Q3735065) (← links)
- Generalizing Automath by means of a lambda-typed lambda calculus (Q3793765) (← links)
- (Q3805882) (← links)
- (Q3877069) (← links)
- (Q3880323) (← links)
- (Q4038654) (← links)
- (Q4218107) (← links)
- (Q4222932) (← links)
- (Q4223028) (← links)
- A relevant analysis of natural deduction (Q4228076) (← links)
- Type-theoretical checking and philosophy of mathematics (Q4247300) (← links)
- (Q4250369) (← links)
- (Q4260701) (← links)
- (Q4263160) (← links)
- (Q4263878) (← links)
- (Q4296948) (← links)
- Pure type systems with more liberal rules (Q4328821) (← links)
- (Q4357055) (← links)
- The Impact of the Lambda Calculus in Logic and Computer Science (Q4359526) (← links)
- (Q4362909) (← links)
- (Q4362916) (← links)
- (Q4364398) (← links)
- (Q4390746) (← links)
- Reductions, intersection types, and explicit substitutions (Q4405688) (← links)
- (Q4411846) (← links)
- (Q4435460) (← links)
- (Q4435473) (← links)
- (Q4448356) (← links)
- (Q4449232) (← links)
- TinkerType: a language for playing with formal systems (Q4457834) (← links)
- Type checking dependent (record) types and subtyping (Q4500363) (← links)
- A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs (Q4506460) (← links)
- (Q4525289) (← links)
- (Q4525290) (← links)
- A Constructive Logic for Services and Information Flow in Computer Networks (Q4525951) (← links)
