Álvaro García-Pérez

Orcid: 0000-0002-9558-6037

According to our database1, Álvaro García-Pérez authored at least 21 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Pure Subtype Systems Are Type-Safe.
CoRR, 2024

Fantastyc: Blockchain-based Federated Learning Made Secure and Practical.
CoRR, 2024

Notara: Efficient Blockchain Asset Notarization Service.
Proceedings of the 6th Conference on Blockchain Research & Applications for Innovative Networks and Services , 2024

2022
Equivalence of eval-readback and eval-apply big-step evaluators by regimentation of the lambda-calculus's strategy space.
CoRR, 2022

2021
SoK: Achieving State Machine Replication in Blockchains based on Repeated Consensus.
CoRR, 2021

2019
Rule Formats for Nominal Process Calculi.
Log. Methods Comput. Sci., 2019

The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus.
J. Funct. Program., 2019

Deconstructing Stellar Consensus (Extended Version).
CoRR, 2019

Deconstructing Stellar Consensus.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

2018
Federated Byzantine Quorum Systems (Extended Version).
CoRR, 2018

Paxos Consensus, Deconstructed and Abstracted (Extended Version).
CoRR, 2018

Federated Byzantine Quorum Systems.
Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

Paxos Consensus, Deconstructed and Abstracted.
Proceedings of the Programming Languages and Systems, 2018

2017
A unified rule format for bounded nondeterminism in SOS with terms as labels.
J. Log. Algebraic Methods Program., 2017

2016
No solvable lambda-value term left behind.
Log. Methods Comput. Sci., 2016

Rule Formats for Bounded Nondeterminism in Structural Operational Semantics.
Proceedings of the Semantics, Logics, and Calculi, 2016

2014
Operational Aspects of Full Reduction in Lambda Calculi.
PhD thesis, 2014

On the syntactic and functional correspondence between hybrid (or layered) normalisers and abstract machines.
Sci. Comput. Program., 2014

Deriving interpretations of the gradually-typed lambda calculus.
Proceedings of the ACM SIGPLAN 2014 workshop on Partial evaluation and program manipulation, 2014

2013
Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order.
Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

A syntactic and functional correspondence between reduction semantics and reduction-free full normalisers.
Proceedings of the ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation, 2013


  Loading...