default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMário Florido
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i9]João Barbosa, Mário Florido, Vítor Santos Costa:
Regular Typed Unification. CoRR abs/2404.16406 (2024)- [i8]Rodrigo Marques, Mário Florido, Pedro B. Vasconcelos:
Towards Algebraic Subtyping for Extensible Records. CoRR abs/2407.06747 (2024) - 2023
- [c43]Pedro Ângelo, Viviana Bono, Mariangiola Dezani-Ciancaglini, Mário Florido
:
Gradual Guarantee for FJ with lambda-Expressions. FTfJP@ECOOP 2023: 32-38 - [c42]Ana Carolina Silva, Manuel Barbosa, Mário Florido:
Execution Time Program Verification with Tight Bounds. PADL 2023: 56-72 - [c41]Miguel Abreu, Pedro Mota, Luís Paulo Reis, Nuno Lau, Mário Florido:
FC Portugal: RoboCup 2023 3D Simulation League Champions. RoboCup 2023: 416-427 - 2022
- [c40]Sandra Alves, Mário Florido:
Structural Rules and Algebraic Properties of Intersection Types. ICTAC 2022: 60-77 - [c39]Pedro Ângelo, Mário Florido:
Type Inference for Rank-2 Intersection Types Using Set Unification. ICTAC 2022: 462-480 - [c38]João Barbosa, Mário Florido, Vítor Santos Costa:
Typed SLD-Resolution: Dynamic Typing for Logic Programming. LOPSTR 2022: 123-141 - [c37]Pedro Ângelo, Mário Florido:
A Typed Lambda Calculus with Gradual Intersection Types. PPDP 2022: 9:1-9:13 - [c36]Fábio Reis, Sandra Alves, Mário Florido:
Linear Rank Intersection Types. TYPES 2022: 8:1-8:21 - [i7]Sandra Alves, Mário Florido:
Structural Rules and Algebraic Properties of Intersection Types. CoRR abs/2204.12376 (2022) - [i6]João Barbosa, Mário Florido, Vítor Santos Costa:
Typed SLD-Resolution: Dynamic Typing for Logic Programming. CoRR abs/2208.00192 (2022) - [i5]Ana Carolina Silva, Manuel Barbosa, Mário Florido:
Execution Time Program Verification With Tight Bounds. CoRR abs/2210.11105 (2022) - [i4]Fábio Reis, Sandra Alves, Mário Florido:
Linear Rank Intersection Types. CoRR abs/2211.17186 (2022) - 2021
- [c35]João Barbosa, Mário Florido, Vítor Santos Costa:
Data Type Inference for Logic Programming. LOPSTR 2021: 16-37 - [i3]João Barbosa, Mário Florido, Vítor Santos Costa:
Data Type Inference for Logic Programming. CoRR abs/2108.06562 (2021) - 2020
- [c34]Sara Moreira, Pedro B. Vasconcelos, Mário Florido:
Resource Analysis for Lazy Evaluation with Polynomial Potential. IFL 2020: 104-114
2010 – 2019
- 2019
- [c33]Pedro Ângelo, Mário Florido:
Type Inference for Rank 2 Gradual Intersection Types. TFP 2019: 84-120 - [c32]João Barbosa, Mário Florido, Vítor Santos Costa:
A Three-Valued Semantics for Typed Logic Programming. ICLP Technical Communications 2019: 36-51 - 2018
- [j10]Sandra Alves, Besik Dundua, Mário Florido, Temur Kutsia:
Pattern-based calculi with finitary matching. Log. J. IGPL 26(2): 203-243 (2018) - 2017
- [j9]Steffen Jost, Pedro B. Vasconcelos, Mário Florido, Kevin Hammond:
Type-Based Cost Analysis for Lazy Functional Languages. J. Autom. Reason. 59(1): 87-120 (2017) - [e2]Vivek Nigam, Mário Florido:
11th Workshop on Logical and Semantic Frameworks with Applications, LSFA 2016, Porto, Portugal, January 1, 2016. Electronic Notes in Theoretical Computer Science 332, Elsevier 2017 [contents] - 2016
- [j8]Besik Dundua, Mário Florido, Temur Kutsia, Mircea Marin:
CLP(H): Constraint logic programming for hedges. Theory Pract. Log. Program. 16(2): 141-162 (2016) - [c31]Miguel E. P. Silva, Mário Florido, Frank Pfenning:
Non-Blocking Concurrent Imperative Programming with Session Types. LINEARITY 2016: 64-72 - [c30]Vivek Nigam, Mário Florido:
Preface. LSFA 2016: 1-2 - 2015
- [j7]Vítor Rodrigues, Benny Akesson, Mário Florido, Simão Melo de Sousa, João Pedro Pedroso, Pedro B. Vasconcelos:
Certifying execution time in multicores. Sci. Comput. Program. 111: 505-534 (2015) - [c29]Pedro B. Vasconcelos, Steffen Jost, Mário Florido, Kevin Hammond:
Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages. ESOP 2015: 787-811 - [c28]Besik Dundua, Mário Florido, Temur Kutsia:
Lambda Calculus with Regular Types. SYNASC 2015: 129-136 - [i2]Besik Dundua, Mário Florido, Temur Kutsia, Mircea Marin:
CLP(H): Constraint Logic Programming for Hedges. CoRR abs/1503.00336 (2015) - 2014
- [j6]Mário Florido, Ian Mackie:
Linearity in Computation. J. Log. Comput. 24(3): 511-512 (2014) - [j5]Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie:
Linearity: A Roadmap. J. Log. Comput. 24(3): 513-529 (2014) - [c27]Cláudio Amaral, Mário Florido, Vítor Santos Costa:
PrologCheck - Property-Based Testing in Prolog. FLOPS 2014: 1-17 - [c26]Besik Dundua, Mário Florido, Temur Kutsia, Mircea Marin:
Constraint Logic Programming for Hedges: A Semantic Reconstruction. FLOPS 2014: 285-301 - [c25]Mário Pereira, Sandra Alves, Mário Florido:
Liquid Intersection Types. ITRS 2014: 24-42 - 2013
- [c24]Vítor Rodrigues, Benny Akesson, Simão Melo de Sousa, Mário Florido:
A Declarative Compositional Timing Analysis for Multicores Using the Latency-Rate Abstraction. PADL 2013: 43-59 - 2012
- [c23]Hugo R. Simões, Pedro B. Vasconcelos, Mário Florido, Steffen Jost, Kevin Hammond:
Automatic amortised analysis of dynamic memory allocation for lazy functional programs. ICFP 2012: 165-176 - 2011
- [c22]Cláudio Amaral, Mário Florido, Patrik Jansson:
Interfacing dynamically typed languages and the why tool: reasoning about lists and tuples. Erlang Workshop 2011: 92-93 - [c21]Vítor Rodrigues, João Pedro Pedroso, Mário Florido, Simão Melo de Sousa:
Certifying Execution Time. FOPARA 2011: 108-125 - [c20]Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie:
Linearity and recursion in a typed Lambda-calculus. PPDP 2011: 173-182 - [c19]Vítor Rodrigues, Mário Florido, Simão Melo de Sousa:
A Functional Approach to Worst-Case Execution Time Analysis. WFLP 2011: 86-103 - 2010
- [j4]Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie:
Linearity and iterator types for Gödel's System. High. Order Symb. Comput. 23(1): 1-27 (2010) - [j3]Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie:
Gödel's system tau revisited. Theor. Comput. Sci. 411(11-13): 1484-1500 (2010) - [c18]Jorge Coelho, Besik Dundua, Mário Florido, Temur Kutsia:
A Rule-Based Approach to XML Processing and Web Reasoning. RR 2010: 164-172 - [i1]Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie:
Linear Recursion. CoRR abs/1001.3368 (2010)
2000 – 2009
- 2009
- [c17]Jorge Coelho, Mário Florido, Temur Kutsia:
Collaborative Schema Construction using Regular Sequence Types. IRI 2009: 290-295 - [e1]Mário Florido, Ian Mackie:
Proceedings First International Workshop on Linearity, LINEARITY 2009, Coimbra, Portugal, 12th September 2009. EPTCS 22, 2009 [contents] - 2007
- [c16]Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie:
Linear Recursive Functions. Rewriting, Computation and Proof 2007: 182-195 - [c15]Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie:
Iterator Types. FoSSaCS 2007: 17-31 - [c14]Jorge Coelho, Mário Florido:
Type-Based Static and Dynamic Website Verification. ICIW 2007: 32 - [c13]Jorge Coelho, Mário Florido:
XCentric: A Logic-Programming Language for XML Processing. PLAN-X 2007: 93-94 - [c12]Jorge Coelho, Mário Florido:
XCentric: logic programming for XML processing. WIDM 2007: 1-8 - [c11]Jorge Coelho, Mário Florido, Temur Kutsia:
Sequence Disunification and Its Application in Collaborative Schema Construction. WISE Workshops 2007: 91-102 - [c10]Sandra Alves, Mário Florido, Ian Mackie, François-Régis Sinot:
Minimality in a Linear Calculus with Iteration. WRS@RDP 2007: 163-179 - 2006
- [c9]Jorge Coelho, Mário Florido:
VeriFLog: A Constraint Logic Programming Approach to Verification of Website Content. APWeb Workshops 2006: 148-156 - [c8]Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie:
The Power of Linear Functions. CSL 2006: 119-134 - [c7]Hugo R. Simões, Kevin Hammond, Mário Florido, Pedro B. Vasconcelos:
Using Intersection Types for Cost-Analysis of Higher-Order Polymorphic Functional Programs. TYPES 2006: 221-236 - [c6]Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie:
The Power of Closed Reduction Strategies. WRS@FLoC 2006: 57-74 - 2005
- [j2]Sandra Alves, Mário Florido:
Weak linearization of the lambda calculus. Theor. Comput. Sci. 342(1): 79-103 (2005) - 2004
- [j1]Mário Florido, Luís Damas:
Linearization of the lambda-calculus and its relation with intersection type systems. J. Funct. Program. 14(5): 519-546 (2004) - [c5]Jorge Coelho, Mário Florido:
CLP(Flex): Constraint Logic Programming Applied to XML Processing. CoopIS/DOA/ODBASE (2) 2004: 1098-1112 - 2003
- [c4]Sandra Alves, Mário Florido:
Linearization by Program Transformation. LOPSTR 2003: 160-175 - [c3]Jorge Coelho, Mário Florido:
Type-Based XML Processing in Logic Programming. PADL 2003: 273-285 - 2002
- [c2]Sandra Alves, Mário Florido:
On the Relation between Rank 2 Intersection Types and Simple Types. APPIA-GULP-PRODE 2002: 259-274 - 2001
- [c1]Sandra Alves, Mário Florido:
Type Inference using Constraint Handling Rules. WFLP 2001: 56-72
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
