The following pages link to Wilmer Ricciotti (Q744985):
Displayed 20 items.
- A formalization of multi-tape Turing machines (Q744986) (← links)
- Item:Q744985 (redirect page) (← links)
- A compact kernel for the calculus of inductive constructions (Q1040007) (← links)
- Explicit auditing (Q1623147) (← links)
- Formal metatheory of programming languages in the Matita interactive theorem prover (Q1945919) (← links)
- A formalization of SQL with nulls (Q2102947) (← links)
- Query lifting. Language-integrated query for heterogeneous nested collections (Q2233480) (← links)
- A canonical locally named representation of binding (Q2392482) (← links)
- Binding Structures as an Abstract Data Type (Q2802464) (← links)
- A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions (Q2881085) (← links)
- A Web Interface for Matita (Q2907340) (← links)
- Formalizing Turing Machines (Q2915013) (← links)
- Hints in Unification (Q3183522) (← links)
- About the Formalization of Some Results by Chebyshev in Number Theory (Q3638243) (← links)
- Rating Disambiguation Errors (Q4916064) (← links)
- Strongly-Normalizing Higher-Order Relational Queries (Q5043580) (← links)
- (Q5111206) (← links)
- (Q5195248) (← links)
- Matita Tutorial (Q5195259) (← links)
- The Matita Interactive Theorem Prover (Q5200015) (← links)