Alberto Pardo

According to our database1, Alberto Pardo authored at least 41 papers between 1989 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
A gradual type system for Elixir.
J. Comput. Lang., 2022

2021
Structure verification of deep neural networks at compilation time.
J. Comput. Lang., 2021

2020
Agda Formalization of a Security-preserving Translation from Flow-sensitive to Flow-insensitive Security Types.
Proceedings of the 15th International Workshop on Logical and Semantic Frameworks with Applications, 2020

2019
Memoized zipper-based attribute grammars and their higher order extension.
Sci. Comput. Program., 2019

Java Stream Fusion: Adapting FP mechanisms for an OO setting.
Proceedings of the XXIII Brazilian Symposium on Programming Languages, 2019

Structure verification of deep neural networks at compilation time using dependent types.
Proceedings of the XXIII Brazilian Symposium on Programming Languages, 2019

Attribute grammars fly first-class... safer!: dealing with DSL errors in type-level programming.
Proceedings of the IFL '19: Implementation and Application of Functional Languages, 2019

2018
An Internalist Approach to Correct-by-Construction Compilers.
Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018

A Staged Embedding of Attribute Grammars in Haskell.
Proceedings of the 30th Symposium on Implementation and Application of Functional Languages, 2018

2017
Extensible records in Idris.
Proceedings of the 21st Brazilian Symposium on Programming Languages, 2017

Automating systematic mappings, adding quality to quantity: poster.
Proceedings of the 39th International Conference on Software Engineering, 2017

2016
Multiple intermediate structure deforestation by shortcut fusion.
Sci. Comput. Program., 2016

Savana: A Global Information Extraction and Terminology Expansion Framework in the Medical Domain.
Proces. del Leng. Natural, 2016

Memoized Zipper-Based Attribute Grammars.
Proceedings of the Programming Languages - 20th Brazilian Symposium, 2016

2015
SEFM: software engineering and formal methods.
Softw. Syst. Model., 2015

Painless Parallelism on Heterogeneous Hardware Leveraging the Functional Paradigm.
Proceedings of the 2015 International Symposium on Computer Architecture and High Performance Computing Workshops, 2015

Watch Out for that Tree! A Tutorial on Shortcut Deforestation.
Proceedings of the Central European Functional Programming School - 6th Summer School, 2015

Approximation of Nested Fixpoints - A Coalgebraic View of Parametric Dataypes.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

An abstract machine for integrating heterogeneous web applications.
Proceedings of the 12th IEEE/ACS International Conference of Computer Systems and Applications, 2015

2014
A Security Types Preserving Compiler in Haskell.
Proceedings of the Programming Languages - 18th Brazilian Symposium, 2014

2013
A shortcut fusion approach to accumulations.
Sci. Comput. Program., 2013

Formal semantics and expressiveness of a web service composition language.
Proceedings of the 28th Annual ACM Symposium on Applied Computing, 2013

Just do it while compiling!: fast extensible records in haskell.
Proceedings of the ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation, 2013

Towards a functional run-time for dense NLA domain.
Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing, 2013

2011
Shortcut fusion rules for the derivation of circular and higher-order programs.
High. Order Symb. Comput., 2011

Applicative Shortcut Fusion.
Proceedings of the Trends in Functional Programming, 12th International Symposium, 2011

Exploiting algebra/coalgebra duality for program fusion extensions.
Proceedings of the Language Descriptions, Tools and Applications, 2011

2010
On some fast well-balanced first order solvers for nonconservative systems.
Math. Comput., 2010

2009
Shortcut fusion rules for the derivation of circular and higher-order monadic programs.
Proceedings of the 2009 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, 2009

2008
Shortcut Fusion of Monadic Programs.
J. Univers. Comput. Sci., 2008

2007
A shortcut fusion rule for circular program calculation.
Proceedings of the ACM SIGPLAN Workshop on Haskell, 2007

2006
Program Fusion with Paramorphisms.
Proceedings of the Workshop on Mathematically Structured Functional Programming, 2006

A multi-stage language with intensional analysis.
Proceedings of the Generative Programming and Component Engineering, 2006

2004
Combining Datatypes and Effects.
Proceedings of the Advanced Functional Programming, 2004

2002
Generic Accumulations.
Proceedings of the Generic Programming, 2002

2001
A calculational approach to recursive programs with effects / von Albert Pardo.
PhD thesis, 2001

Fusion of recursive programs with computational effects.
Theor. Comput. Sci., 2001

Recursion Schemes from Comonads.
Nord. J. Comput., 2001

1998
Monadic Corecursion - Definition, Fusion Laws, and Applications.
Proceedings of the First Workshop on Coalgebraic Methods in Computer Science, 1998

1990
O Uso das Semânticas Indutiva e Denotacional na Tradução Fonte-a-Fonte de Linguagens de Programação.
Proceedings of the 4th Brazilian Symposium on Software Engineering, 1990

1989
LindA: Uma Linguagem de Autoria Automática para Hipertexto.
Proceedings of the 3rd Brazilian Symposium on Software Engineering, 1989


  Loading...