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 1029

  • Page / 42
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

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

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

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

Advanced functional programming (5th international school, AFP 2004, Tartu, Estonia, August 14 - 21, 2004, revised lectures)Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28540-7, 1Vol, VIII-357 p, isbn 3-540-28540-7Conference Proceedings

Sexy types in actionSHAN, Chung-Chieh.ACM SIGPLAN notices. 2004, Vol 39, Num 5, pp 15-22, issn 1523-2867, 8 p.Article

Comparing functional paradigms for exact real-number computationBAUER, Andrej; ESCARDO, Martin Hötzel; SIMPSON, Alex et al.Lecture notes in computer science. 2002, pp 488-500, issn 0302-9743, isbn 3-540-43864-5, 13 p.Conference Paper

Central European Functional Programming School (First summer school, CEFP 2005, Budapest, Hungary, July 4-15, 2005)Horvath, Zoltan.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-46843-9, 1Vol, 256 p., isbn 3-540-46843-9Conference Proceedings

Efficient strong sequentiality using replacement restrictionsLUCAS, S.Lecture notes in computer science. 1997, pp 489-496, issn 0302-9743, isbn 3-540-63774-5Conference Paper

Experience report : The reactis validation toolSIMS, Steve; DU VARNEY, Daniel C.ACM SIGPLAN notices. 2007, Vol 42, Num 9, pp 137-139, issn 1523-2867, 3 p.Conference Paper

Vicious circles in orthogonal term rewriting systemsKETEMA, Jeroen; KLOP, Jan Willem; VAN OOSTROM, Vincent et al.Report - Software engineering. 2004, Num 18, pp 1-13, issn 1386-369X, 13 p.Article

Automatic skeletons in Template HaskellHAMMOND, Kevin; BERTHOLD, Jolt; LOOGEN, Rita et al.Parallel processing letters. 2003, Vol 13, Num 3, pp 413-424, issn 0129-6264, 12 p.Article

Runtime interprocedural data placement optimisation for lazy parallel libraries (extended abstract)BECKMANN, O; KELLY, P. H. J.Lecture notes in computer science. 1997, pp 306-309, issn 0302-9743, isbn 3-540-63440-1Conference Paper

Une équivalence sur les lambda-termesREGNIER, L.Theoretical computer science. 1994, Vol 126, Num 2, pp 281-292, issn 0304-3975Article

  • Page / 42