Show simple item record

dc.contributor.authorHanus, Michael
dc.contributor.authorPeemöller, Björn
dc.contributor.authorReck, Fabian
dc.contributor.editorJähnichen, Stefan
dc.contributor.editorRumpe, Bernhard
dc.contributor.editorSchlingloff, Holger
dc.date.accessioned2018-11-19T13:30:01Z
dc.date.available2018-11-19T13:30:01Z
dc.date.issued2012
dc.identifier.isbn978-3-88579-293-2
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/18376
dc.description.abstractIn this paper we discuss our practical experiences with the use of different search strategies in functional logic programs. In particular, we show that complete strategies, like breadth-first search or iterative deepening search, are a viable alternative to incomplete strategies, like depth-first search, that have been favored in the past for logic programming languages.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofSoftware Engineering 2012. Workshopband
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-199
dc.titleSearch strategies for functional logic programmingen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages61-74
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationBerlin
mci.conference.date27. Februar - 2. März 2012


Files in this item

Thumbnail

Show simple item record