The following pages link to Luca Roversi (Q737108):
Displaying 32 items.
- A class of reversible primitive recursive functions (Q737109) (← links)
- Lambda calculus and intuitionistic linear logic (Q1378432) (← links)
- The fixed point problem of a simple reversible language (Q1989327) (← links)
- A class of recursive permutations which is primitive recursive complete (Q1989331) (← links)
- On the expressivity of total reversible programming languages (Q2039893) (← links)
- Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean} (Q2097420) (← links)
- A type-assignment of linear erasure and duplication (Q2193281) (← links)
- Linear Lambda Calculus and Deep Inference (Q3007666) (← links)
- (Q3024851) (← links)
- Typing a Core Binary-Field Arithmetic in a Light Logic (Q3167524) (← links)
- A By-Level Analysis of Multiplicative Exponential Linear Logic (Q3182938) (← links)
- Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion? (Q3460503) (← links)
- Taming Modal Impredicativity: Superlazy Reduction (Q3605525) (← links)
- Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets (Q3638260) (← links)
- (Q4249177) (← links)
- (Q4362931) (← links)
- A Certified Study of a Reversible Programming Language (Q4580228) (← links)
- The call-by-value λ-calculus: a semantic investigation (Q4719353) (← links)
- (Q4783322) (← links)
- Intersection Types from a Proof-theoretic Perspective (Q4903721) (← links)
- (Q4945245) (← links)
- (Q5018491) (← links)
- Splitting Recursion Schemes into Reversible and Classical Interacting Threads (Q5162610) (← links)
- LIGHT AFFINE LOGIC AS A PROGRAMMING LANGUAGE: A FIRST CONTRIBUTION (Q5249032) (← links)
- Types for Proofs and Programs (Q5712304) (← links)
- Intuitionistic Light Affine Logic (Q5738953) (← links)
- A deep inference system with a self-dual binder which is complete for linear lambda calculus (Q5739978) (← links)
- A Local Criterion for Polynomial-Time Stratified Computations (Q5747634) (← links)
- Certifying expressive power and algorithms of reversible primitive permutations with \textsf{Lean} (Q6151610) (← links)
- Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem (Q6516094) (← links)
- Algorithmically expressive, always-terminating model for reversible computation (Q6637584) (← links)
- Termination of rewriting on reversible Boolean circuits as a free 3-category problem (Q6664060) (← links)
