The following pages link to Andrea Asperti (Q287278):
Displaying 50 items.
- Reverse complexity (Q287279) (← links)
- Paths, computations and labels in the \(\lambda\)-calculus (Q673626) (← links)
- A formalization of multi-tape Turing machines (Q744986) (← links)
- Stability and computability in coherent domains (Q752707) (← links)
- (Q1040003) (redirect page) (← links)
- A compact kernel for the calculus of inductive constructions (Q1040007) (← links)
- Categorical models of polymorphism (Q1193592) (← links)
- Interaction systems II: The practice of optimal reductions (Q1350498) (← links)
- Safe operators: Brackets closed forever. Optimizing optimal \(\lambda\)-calculus implementations (Q1392661) (← links)
- Mathematical knowledge management in HELM (Q1810904) (← links)
- Parallel beta reduction is not elementary recursive (Q1854460) (← links)
- (Optimal) duplication is not elementary recursive (Q1881231) (← links)
- Formal metatheory of programming languages in the Matita interactive theorem prover (Q1945919) (← links)
- User interaction with the Matita proof assistant (Q2462635) (← links)
- (Q2767919) (← links)
- A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions (Q2881085) (← links)
- Proof, Message and Certificate (Q2907309) (← links)
- A Web Interface for Matita (Q2907340) (← links)
- A Compact Proof of Decidability for Regular Expression Equivalence (Q2914749) (← links)
- Formalizing Turing Machines (Q2915013) (← links)
- A Formal Proof of Borodin-Trakhtenbrot’s Gap Theorem (Q2938046) (← links)
- Computational Complexity Via Finite Types (Q2946764) (← links)
- (Q3024818) (← links)
- (Q3026332) (← links)
- Zen and the art of formalisation (Q3094169) (← links)
- Hints in Unification (Q3183522) (← links)
- The intensional content of Rice's theorem (Q3189831) (← links)
- (Q3497621) (← links)
- Some Considerations on the Usability of Interactive Provers (Q3582703) (← links)
- Smart Matching (Q3582713) (← links)
- Crafting a Proof Assistant (Q3612433) (← links)
- About the Formalization of Some Results by Chebyshev in Number Theory (Q3638243) (← links)
- Social processes, program verification and all that (Q3643359) (← links)
- (Q3999603) (← links)
- (Q4029583) (← links)
- Interaction Systems I: The theory of optimal reductions (Q4327409) (← links)
- (Q4327828) (← links)
- The bologna optimal higher-order machine (Q4339015) (← links)
- A sufficient condition for completability of partial combinatory algebras (Q4382471) (← links)
- (Q4474349) (← links)
- (Q4490737) (← links)
- (Q4501135) (← links)
- On the dynamics of sharing graphs (Q4571958) (← links)
- A categorical understanding of environment machines (Q4763978) (← links)
- (Q4790651) (← links)
- Causal dependencies in multiplicative linear logic with MIX (Q4862762) (← links)
- Rating Disambiguation Errors (Q4916064) (← links)
- (Q4964707) (← links)
- Optimal reductions in interaction systems (Q5044756) (← links)
- Paths, computations and labels in the λ-calculus (Q5055792) (← links)
