Mostrar el registro sencillo del ítem

dc.contributor.authorFigueiredo, Lucíliaspa
dc.contributor.authorCamarão, Carlosspa
dc.date.accessioned2020-10-27T00:21:31Z
dc.date.available2020-10-27T00:21:31Z
dc.date.issued2002-06-01
dc.identifier.issn2539-2115
dc.identifier.issn1657-2831
dc.identifier.urihttp://hdl.handle.net/20.500.12749/9065
dc.description.abstractEste documento presenta una construcción de declaración de tipo que proporciona un sinónimo de tipo, un tipo de datos, un tipo abstracto con vistas, un subtipo de un tipo existente o un módulo (colección de declaraciones), al estilo de los lenguajes de programación funcionales modernos que proporcionan soporte para polimorfismo paramétrico.spa
dc.format.mimetypeapplication/pdfspa
dc.language.isospaspa
dc.publisherUniversidad Autónoma de Bucaramanga UNAB
dc.relationhttps://revistas.unab.edu.co/index.php/rcc/article/view/1106/1078
dc.relation.urihttps://revistas.unab.edu.co/index.php/rcc/article/view/1106
dc.rightsDerechos de autor 2002 Revista Colombiana de Computación
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/co/
dc.sourceRevista Colombiana de Computación; Vol. 3 Núm. 1 (2002): Revista Colombiana de Computación; 21-40
dc.subjectInnovaciones tecnológicas
dc.subjectCiencia de los computadores
dc.subjectDesarrollo de tecnología
dc.subjectIngeniería de sistemas
dc.subjectInvestigaciones
dc.subjectTecnologías de la información y las comunicaciones
dc.subjectTIC´s
dc.titleUna vista sobre tipos abstractos y extensiblesspa
dc.title.translatedA view on abstract and extensibles typeseng
dc.type.driverinfo:eu-repo/semantics/article
dc.type.localArtículospa
dc.type.coarhttp://purl.org/coar/resource_type/c_7a1f
dc.subject.keywordsTechnological innovationseng
dc.subject.keywordsComputer scienceeng
dc.subject.keywordsTechnology developmenteng
dc.subject.keywordsSystems engineeringeng
dc.subject.keywordsInvestigationseng
dc.subject.keywordsInformation and communication technologieseng
dc.subject.keywordsICT'seng
dc.subject.keywordsLanguage styleseng
dc.subject.keywordsFunctional scheduleseng
dc.identifier.instnameinstname:Universidad Autónoma de Bucaramanga UNABspa
dc.type.hasversionInfo:eu-repo/semantics/publishedVersion
dc.type.hasversioninfo:eu-repo/semantics/acceptedVersion
dc.rights.accessrightsinfo:eu-repo/semantics/openAccessspa
dc.relation.references[1] Alexander Aiken and Edward L. Wimmers. Type inclusion constraints and type in-ference. In Proceedings of ACM Functional Programming Languages and Computer Architecture, 1993.
dc.relation.references[2] R. Bailey. Functional Programming with Hope. Ellis Horwood, 1990.spa
dc.relation.references[3] Richard Bird. Introduction to Functional Programming using Haskell. Prentice-Hall, 1998. 2nd ed.
dc.relation.referencesF. Warren Burton and Robert D. Cameron. Pattern matching with abstract data types. Journal of Functional Programming, 3(2):171-190, April 1993.
dc.relation.references[5] Carlos Camarao and Lucflia Figueiredo. Type Inference for Overloading without Re-strictions, Declarations or Annotations. Proc. of FLOPS'99, LNCS 1722, pages 37-52, 1999.
dc.relation.referencesCarlos Camarao and Lucflia Figueiredo. Type Inference for Overloading. Technical report, UFMG, 2001. Submitted for publication. Available at http://www.dcc.ufmg.brrcarnarao/ct-tech-rep.ps.
dc.relation.references[7] Guy Cousineau and Michel Mauny. The Functional Approach to Programming. Cam-bridge University Press, 1998.
dc.relation.references[8] Pierre-Lous Curien and Giorgio Ghelli. Coherence of subsumption: Minimum typing and type-checking in F<. Mathematical Structures in Computer Science, 2:55-91, 1992. Also in Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, The MIT Press, 1993.
dc.relation.references[9] You-Chin Full and Prateek Mishra. Type Inference with Subtypes. In 2nd European Symposium on Programming (ESOP'88), pages 94-114, 1988. Springer-Verlag LNCS 300.
dc.relation.references[10] You-Chin Fuh and Prateek Mishra. Type inference with subtypes. Theoretical Computer Science, 73(2):155-175, 1990.
dc.relation.references[11] You-Chin Full and Prateek Mishra. Polymorphic Subtype Inference: Closing the Theory-Practice Cap. In Proceedings of TAPSOFT'89, volume 2, pages 167-183, 1997.
dc.relation.references[12] Pedro P. Costanza, Ricardo Pala, and Manuel Nufiez. A New Look at Patternn Match-ing in Abstract Data Types. ACM SICPLAN International Conference on Flinctioruil Programming, pages 110-121, May 1996.
dc.relation.references[13] My Hoang and John Mitchell. Lower bounds on type inference with subtypes. Confer-ence Record of POPL'95: the 25th ACM SICPLAN-SICACT Symposium on Principles of Programming Languages, pages 176-185, 1995.
dc.relation.references[14] Paul Hudak. The Haskell School of Expression: Learning Functional Programming through Multimedia. Cambridge University Press, 2000.
dc.relation.references[15] Cliff B. Jones. Systematic Software Development using VDM. Prentice-Hall, second edition, 1990.
dc.relation.references[16] Mark Jones et al. Hugs98. http://www.haskell.org/hugs/, 1998.
dc.relation.references[18] Simon Marlow and Philip Waller. A practical subtyping system for Erlang. In Pro-ceedings of ICFP'97: the ACM SIGPLAN International Conference on Functional Pro-gramming, pages 136-149, 1997.
dc.relation.references19] Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MITspa
dc.relation.references20] John Mitchell. Type inference with simple subtypes. Journal of Functional Program-ming, 1(3):245-285, July 1991.
dc.relation.references[21] Johan Nordlander. Pragmatic Subtyping in Polymorphic Languages. In Proceedings of ICFP'98.- the ACM SIGPLAN International Conference on anctional Programming, 1998. volume 34(1) of ACM SIGPLAN Notices, pages 216-227, June 1999.
dc.relation.references22] Johan Nordlander. Polymorphic Subtyping in O'Haskell. In Proceedings of the APPSEm Workshop on Subtyping and Dependent Types in Programming, 2000.
dc.relation.references[23] Johan Nordlander. Polymorphic subtyping in o'haskell. In Proceedings of the APPSEm Workshop on Subtyping and Dependent Types in Programming, 2000.
dc.relation.references24] Chris Okasaki. Views for Standard ML. In Proc. 1998 ACM SIGPLAN Workshop on ML, 1998.
dc.relation.references[25] Lawrence Paulson. ML for the Working Programmer. Cambridge University Press, 1996. 2nd edition.
dc.relation.references[26J Rawls Pottier. A Framework for Type Inference with Subtyping. In Proceedings of ICFP'98: the ACM SICPLAN International Conference on Functional Programming, 1998. volume 34(1) of ACM SICPLAN Notices, pages 228-238, June 1999.
dc.relation.references[27J Jacob Rehof. Minimal Typings in Atomic Subtyping. Proceedings of POPL'97: the 24th ACM SICPLAN-SICACT Symposium on Principles of Programming Languages, 1997.
dc.relation.references[28J Jakob Rehof. The Complexity of Simple Subtyping Systems. PhD thesis, University of Copenhagen, 1998.
dc.relation.references[29J Didier Remy and J4r6me Vouillon. Objective ML: An effective object-oriented extension to ML. Theory And Practice of Object Systems, 4(1):27-50, 1998.
dc.relation.references[30J Dilip Sequeira. Type Inference with Bounded Quantification. PhD thesis, University of Edinburgh, 1998.
dc.relation.references31J Geoffrey Smith. Polymorphic Type Inference for Languages with Overloading and Sub-typing. PhD thesis, Cornell University, 1991.
dc.relation.references[32J Geoffrey Smith. Principal type schemes for functional programs with overloading and subtyping. Science of Computer Programming, 23:197-226, 1994.
dc.relation.references[33J Simon Thompson. Laws in Miranda. In Proceedings of the ACM Conference on Lisp and Functional Programming, pages 1-12, 1986.
dc.relation.references[34J Simon Thompson. Lawful functions and program verification in Miranda. Science of Computer Programming, 13(2-3):181-218, 1990.
dc.relation.references[35J Simon Thompson. Haskell: The Craft of Functional Programming. Addison-Wesley, 1999. second edition.
dc.relation.references[36J Valery Trifonov and Scott Smith. Subtyping Constrained Types. Proc. SAS'96. LAWS 1145, pages 349-365, 1996.
dc.contributor.googlescholarCamarão, Carlos [2LRi77IAAAAJ]spa
dc.contributor.orcidCamarão, Carlos [0000-0002-4272-9997]spa
dc.subject.lembCiencias de la computaciónspa
dc.subject.lembIngeniero de sistemasspa
dc.subject.lembInvestigaciónspa
dc.subject.lembTecnología de la información y comunicaciónspa
dc.identifier.repourlrepourl:https://repository.unab.edu.co
dc.description.abstractenglishThis paper presents a type declaration construct which provides either a type synonym, a datatype, an abstract type with views, a subtype of an existing type, or a module (collection of declarations), in the style of modern functional&nbsp;programming languages ahich provide support for parametric polymorphism.eng
dc.subject.proposalEstilos de lenguajespa
dc.subject.proposalProgramaciones funcionalesspa
dc.subject.proposalInnovaciones tecnológicasspa
dc.subject.proposalDesarrollo tecnológicospa
dc.type.redcolhttp://purl.org/redcol/resource_type/CJournalArticle
dc.rights.creativecommonsAtribución-NoComercial-SinDerivadas 2.5 Colombia*


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem

Atribución-NoComercial-SinDerivadas 2.5 Colombia
Excepto si se señala otra cosa, la licencia del ítem se describe como Atribución-NoComercial-SinDerivadas 2.5 Colombia