Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Functional programming")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1528

  • Page / 62
Export

Selection :

  • and

A new generic scheme for functional logic programming with constraintsLOPEZ FRAGUAS, Francisco J; RODRIGUEZ ARTALEJO, Mario; DEL VADO VIRSEDA, Rafael et al.Higher-order and symbolic computation. 2007, Vol 20, Num 1-2, pp 73-122, issn 1388-3690, 50 p.Article

Proceedings of the 2011 ACM SIGPLAN International Conference on Functional Programming (ICFP'11)ACM SIGPLAN notices. 2011, Vol 46, Num 9, issn 1523-2867, 466 p.Conference Proceedings

AFP 2002 : advanced functional programming (Oxford, 19-24 August 2002)Jeuring, Johan; Peyton Jones, Simon.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40132-6, VI, 211 p, isbn 3-540-40132-6Conference Proceedings

Experiments in optimizing FPRYDER, B. G; PENDERGRAST, J. S.IEEE transactions on software engineering. 1988, Vol 14, Num 4, pp 444-454, issn 0098-5589Article

Expressible sharing for functional circuit descriptionNAYLOR, Matthew; RUNCIMAN, Colin.Higher-order and symbolic computation (Print). 2009, Vol 22, Num 1, pp 67-80, issn 1388-3690, 14 p.Article

Visual Lisp/CLOS programming in OpenMusicBRESSON, Jean; AGON, Carlos; ASSAYAG, Gérard et al.Higher-order and symbolic computation (Print). 2009, Vol 22, Num 1, pp 81-111, issn 1388-3690, 31 p.Article

Pruning with improving sequences in lazy functional programsIWASAKI, Hideya; MORIMOTO, Takeshi; TAKANO, Yasunao et al.Higher-order and symbolic computation (Print). 2011, Vol 24, Num 4, pp 281-309, issn 1388-3690, 29 p.Article

Explaining the lazy Krivine machine using explicit substitution and addressesLANG, Frédéric.Higher-order and symbolic computation. 2007, Vol 20, Num 3, pp 257-270, issn 1388-3690, 14 p.Article

Productivity of stream definitionsENDRULLIS, Jörg; GRABMAYER, Clemens; HENDRIKS, Dimitri et al.Theoretical computer science. 2010, Vol 411, Num 4-5, pp 765-782, issn 0304-3975, 18 p.Conference Paper

Functional and logic programming (8th international symposium, FLOPS 2006, Fuji-Susono, Japan, April 24-26, 2006)Hagiya, Masami; Wadler, Philip.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-33438-6, 1Vol, X-293 p, isbn 3-540-33438-6Conference Proceedings

Epigram : Practical programming with dependent typesMCBRIDE, Conor.Lecture notes in computer science. 2005, pp 130-170, issn 0302-9743, isbn 3-540-28540-7, 1Vol, 41 p.Conference Paper

Programming with arrowsHUGHES, John.Lecture notes in computer science. 2005, pp 73-129, issn 0302-9743, isbn 3-540-28540-7, 1Vol, 57 p.Conference Paper

Twelf and delphin: Logic and functional programming in a meta-logical frameworkSCHÜRMANN, Carsten.Lecture notes in computer science. 2004, pp 22-23, issn 0302-9743, isbn 3-540-21402-X, 2 p.Conference Paper

SAIG 2001 : semantics, applications, and implementation of program generation (Florence, 6 September 2001)Taha, Walid.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42558-6, X, 218 p, isbn 3-540-42558-6Conference Proceedings

Odd-even sort in powerlistsCORNERUP, J.Information processing letters. 1997, Vol 61, Num 1, pp 15-24, issn 0020-0190Article

Functional programming and geometryCOUSINEAU, G.Lecture notes in computer science. 1997, pp 309-322, issn 0302-9743, isbn 3-540-63398-7Conference Paper

Making form follow function: an exercise in functional programming styleFAIRBAIRN, J.Software, practice & experience. 1987, Vol 17, Num 6, pp 379-386, issn 0038-0644Article

Constructive proofs of the range property in lambda calculusBARENDREGT, H.Theoretical computer science. 1993, Vol 121, Num 1-2, pp 59-69, issn 0304-3975Article

Set-theoretical and other elementary models of the λ-calculusPLOTKIN, G. D.Theoretical computer science. 1993, Vol 121, Num 1-2, pp 351-409, issn 0304-3975Article

Narrowing vs. SLD-resolutionBOSCO, G; GIOVANNETTI, E; MOISO, C et al.Theoretical computer science. 1988, Vol 59, Num 1-2, pp 3-23, issn 0304-3975Conference Paper

FLOPS 2004 : functional and logic programming (Nara, 7-9 April 2004)Kameyama, Yukiyoshi; Stuckey, Peter J.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-21402-X, X, 306 p, isbn 3-540-21402-XConference Proceedings

Narrowing failure in functional logic programmingLOPEZ-FRAGUAS, Francisco Javier; SANCHEZ-HERNANDEZ, Jaime.Lecture notes in computer science. 2002, pp 212-227, issn 0302-9743, isbn 3-540-44233-2, 16 p.Conference Paper

Measuring the cost of storage managementTARDITI, D; DIWAN, A.Lisp and symbolic computation. 1996, Vol 9, Num 4, pp 323-342, issn 0892-4635Article

Type theory and projections for static analysisBAKER-FINCH, C. A.Lisp and symbolic computation. 1995, Vol 8, Num 3, pp 267-285, issn 0892-4635Conference Paper

Functional Logic ProgrammingANTOY, Sergio; HANUS, Michael.Communications of the ACM. 2010, Vol 53, Num 4, pp 74-85, issn 0001-0782, 12 p.Article

  • Page / 62