Information systems have been introduced by Dana Scott as a logic-oriented approach to domain theory: the category of bounded-complete algebraic domains with Scott continuous functions is equivalent to the category of information systems and approximable mappings. In this talk a similar result is presented for continuous L-domains. L-domains have been introduced by Achim Jung. Whereas in bounded-complete domains every bounded set has a (global) least upper bound, this is only locally true in the L-domain case: in every principal ideal each subset has a least upper bound.