Call-by-value Solvability
RAIRO-Theor. Inf. Appl., 33 6 (1999) 507-534
Published online: 2002-08-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
14575 24 (2024)
https://doi.org/10.1007/978-3-031-57231-9_2
14740 338 (2024)
https://doi.org/10.1007/978-3-031-63501-4_18
Quantitative Inhabitation for Different Lambda Calculi in a Unifying Framework
Victor Arrial, Giulio Guerrieri and Delia KesnerProceedings of the ACM on Programming Languages 7 (POPL) 1483 (2023)
https://doi.org/10.1145/3571244
14446 196 (2023)
https://doi.org/10.1007/978-3-031-47963-2_13
The theory of call-by-value solvability
Beniamino Accattoli and Giulio GuerrieriProceedings of the ACM on Programming Languages 6 (ICFP) 855 (2022)
https://doi.org/10.1145/3547652
1 (2021)
https://doi.org/10.1109/LICS52264.2021.9470630
Pure iso-type systems
YANPENG YANG and BRUNO C. D. S. OLIVEIRAJournal of Functional Programming 29 (2019)
https://doi.org/10.1017/S0956796819000108
Abstract machines for Open Call-by-Value
Beniamino Accattoli and Giulio GuerrieriScience of Computer Programming 184 102275 (2019)
https://doi.org/10.1016/j.scico.2019.03.002
Unifying typing and subtyping
Yanpeng Yang and Bruno C. d. S. OliveiraProceedings of the ACM on Programming Languages 1 (OOPSLA) 1 (2017)
https://doi.org/10.1145/3133871
Proof nets and the call-by-value λ-calculus
Beniamino AccattoliTheoretical Computer Science 606 2 (2015)
https://doi.org/10.1016/j.tcs.2015.08.006
141 (2015)
https://doi.org/10.1109/LICS.2015.23
On the syntactic and functional correspondence between hybrid (or layered) normalisers and abstract machines
A. García-Pérez and P. NogueiraScience of Computer Programming 95 176 (2014)
https://doi.org/10.1016/j.scico.2014.05.011
Functional and Logic Programming
Beniamino Accattoli and Luca PaoliniLecture Notes in Computer Science, Functional and Logic Programming 7294 4 (2012)
https://doi.org/10.1007/978-3-642-29822-6_4
Strong normalization from an unusual point of view
Luca Paolini, Elaine Pimentel and Simona Ronchi Della RoccaTheoretical Computer Science 412 (20) 1903 (2011)
https://doi.org/10.1016/j.tcs.2010.12.018
Calculi, types and applications
Stefano Berardi and Ugo de’LiguoroTheoretical Computer Science 398 (1-3) 1 (2008)
https://doi.org/10.1016/j.tcs.2008.01.018
Foundations of Software Science and Computation Structures
Luca Paolini, Elaine Pimentel and Simona Ronchi Della RoccaLecture Notes in Computer Science, Foundations of Software Science and Computation Structures 3921 367 (2006)
https://doi.org/10.1007/11690634_25
Lazy Strong Normalization
Luca Paolini, Elaine Pimentel and Simona Ronchi Della RoccaElectronic Notes in Theoretical Computer Science 136 103 (2005)
https://doi.org/10.1016/j.entcs.2005.06.013
Parametric parameter passing λ-calculus
Luca Paolini and Simona Ronchi Della RoccaInformation and Computation 189 (1) 87 (2004)
https://doi.org/10.1016/j.ic.2003.08.003
Theoretical Computer Science
Luca PaoliniLecture Notes in Computer Science, Theoretical Computer Science 2202 74 (2001)
https://doi.org/10.1007/3-540-45446-2_5