Retrieving library functions by unifying types modulo linear isomorphism
RAIRO-Theor. Inf. Appl., 27 6 (1993) 523-540
Published online: 2017-02-01
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):
Automorphisms of Types and Their Applications
S. Soloviev and J. MalakhovskiJournal of Mathematical Sciences 240 (5) 692 (2019)
https://doi.org/10.1007/s10958-019-04386-8
An algebraic theory for web service contracts
Cosimo Laneve and Luca PadovaniFormal Aspects of Computing 27 (4) 613 (2015)
https://doi.org/10.1007/s00165-015-0334-2
Contract-based discovery of Web services modulo simple orchestrators
Luca PadovaniTheoretical Computer Science 411 (37) 3328 (2010)
https://doi.org/10.1016/j.tcs.2010.05.002
A theory of contracts for Web services
Giuseppe Castagna, Nils Gesbert and Luca PadovaniACM Transactions on Programming Languages and Systems 31 (5) 1 (2009)
https://doi.org/10.1145/1538917.1538920
CONCUR 2008 - Concurrency Theory
Luca PadovaniLecture Notes in Computer Science, CONCUR 2008 - Concurrency Theory 5201 131 (2008)
https://doi.org/10.1007/978-3-540-85361-9_13
A theory of contracts for web services
Giuseppe Castagna, Nils Gesbert and Luca PadovaniACM SIGPLAN Notices 43 (1) 261 (2008)
https://doi.org/10.1145/1328897.1328471
Automatic Program Development
Somesh Jha, Jens Palsberg, Tian Zhao and Fritz HengleinAutomatic Program Development 229 (2008)
https://doi.org/10.1007/978-1-4020-6585-9_15
261 (2008)
https://doi.org/10.1145/1328438.1328471
Customizing an XML–Haskell data binding with type isomorphism inference in Generic Haskell
Frank Atanassow and Johan JeuringScience of Computer Programming 65 (2) 72 (2007)
https://doi.org/10.1016/j.scico.2006.01.005
Web Services and Formal Methods
S. Carpineti, G. Castagna, C. Laneve and L. PadovaniLecture Notes in Computer Science, Web Services and Formal Methods 4184 148 (2006)
https://doi.org/10.1007/11841197_10
Typed Lambda Calculi and Applications
Roberto Di Cosmo, François Pottier and Didier RémyLecture Notes in Computer Science, Typed Lambda Calculi and Applications 3461 179 (2005)
https://doi.org/10.1007/11417170_14
Mathematics of Program Construction
Frank Atanassow and Johan JeuringLecture Notes in Computer Science, Mathematics of Program Construction 3125 32 (2004)
https://doi.org/10.1007/978-3-540-27764-4_4
Foundations of Software Science and Computation Structures
Somesh Jha, Jens Palsberg and Tian ZhaoLecture Notes in Computer Science, Foundations of Software Science and Computation Structures 2303 187 (2002)
https://doi.org/10.1007/3-540-45931-6_14
Efficient and Flexible Matching of Recursive Types
Jens Palsberg and Tian ZhaoInformation and Computation 171 (2) 364 (2001)
https://doi.org/10.1006/inco.2001.3090
388 (2000)
https://doi.org/10.1109/LICS.2000.855786
Automated Deduction — A Basis for Applications
Bernd Fischer, Johann Schumann and Gregor SneltingApplied Logic Series, Automated Deduction — A Basis for Applications 10 265 (1998)
https://doi.org/10.1007/978-94-017-0437-3_11
On the unification problem for Cartesian closed categories
Paliath Narendran, Frank Pfenning and Richard StatmanJournal of Symbolic Logic 62 (2) 636 (1997)
https://doi.org/10.2307/2275552
Category Theory and Computer Science
A. Andreev and S. SolovievLecture Notes in Computer Science, Category Theory and Computer Science 1290 197 (1997)
https://doi.org/10.1007/BFb0026989
Logic Programming and Automated Reasoning
S. SolovievLecture Notes in Computer Science, Logic Programming and Automated Reasoning 698 360 (1993)
https://doi.org/10.1007/3-540-56944-8_71